<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/themes/root/assets/xsl/rss.xsl"?>
<rss version="2.0" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/">
  <channel>
    <title>Results for 10011655152</title>
    <description>Showing 1 - 50 results of 129</description>
    <generator>Laminas_Feed_Writer 2 (https://getlaminas.org)</generator>
    <link>https://www.econbiz.de/similar/results?mlt=author&amp;lng=en&amp;view=rss&amp;id=10011655152&amp;sort=econbiz_created+desc&amp;limit=50</link>
    <opensearch:totalResults>129</opensearch:totalResults>
    <opensearch:startIndex>0</opensearch:startIndex>
    <opensearch:itemsPerPage>50</opensearch:itemsPerPage>
    <opensearch:Query role="request" searchTerms="10011655152" startIndex="0"/>
    <atom:link rel="first" type="application/rss+xml" title="Go to First Page" href="https://www.econbiz.de/similar/results?mlt=author&amp;lng=en&amp;view=rss&amp;page=1&amp;id=10011655152&amp;sort=econbiz_created+desc&amp;limit=50"/>
    <atom:link rel="next" type="application/rss+xml" title="Go to Next Page" href="https://www.econbiz.de/similar/results?mlt=author&amp;lng=en&amp;view=rss&amp;page=2&amp;id=10011655152&amp;sort=econbiz_created+desc&amp;limit=50"/>
    <atom:link rel="last" type="application/rss+xml" title="Go to Last Page" href="https://www.econbiz.de/similar/results?mlt=author&amp;lng=en&amp;view=rss&amp;page=3&amp;id=10011655152&amp;sort=econbiz_created+desc&amp;limit=50"/>
    <atom:link rel="self" type="application/rss+xml" href="https://www.econbiz.de/similar/results?mlt=author&amp;lng=en&amp;view=rss&amp;id=10011655152&amp;sort=econbiz_created+desc&amp;limit=50"/>
    <item>
      <title>A note: approximation algorithms for batch scheduling on shops with job rejection</title>
      <pubDate>Mon, 09 Feb 2026 16:05:38 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-note-approximation-algorithms-for-batch-scheduling-on-shops-with-job-rejection-mosheiov-gur/10015593003?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-note-approximation-algorithms-for-batch-scheduling-on-shops-with-job-rejection-mosheiov-gur/10015593003?sid=1534636718</guid>
      <author>Mosheiov, Gur</author>
      <dc:format>Article</dc:format>
      <dc:date>2025</dc:date>
      <dc:creator>Mosheiov, Gur</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Single machine scheduling to minimize weighted number of early jobs plus total weighted tardiness</title>
      <pubDate>Fri, 30 Jan 2026 15:33:56 +0000</pubDate>
      <link>https://www.econbiz.de/Record/single-machine-scheduling-to-minimize-weighted-number-of-early-jobs-plus-total-weighted-tardiness-atsmony-matan/10015588502?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/single-machine-scheduling-to-minimize-weighted-number-of-early-jobs-plus-total-weighted-tardiness-atsmony-matan/10015588502?sid=1534636718</guid>
      <author>Atsmony, Matan</author>
      <dc:format>Article</dc:format>
      <dc:date>2025</dc:date>
      <dc:creator>Atsmony, Matan</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Scheduling with a weight-modifying activity to minimize the total weighted completion time</title>
      <pubDate>Thu, 07 Nov 2024 09:54:26 +0000</pubDate>
      <link>https://www.econbiz.de/Record/scheduling-with-a-weight-modifying-activity-to-minimize-the-total-weighted-completion-time-lin-bertrand/10015084968?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/scheduling-with-a-weight-modifying-activity-to-minimize-the-total-weighted-completion-time-lin-bertrand/10015084968?sid=1534636718</guid>
      <author>Lin, Bertrand M. T.</author>
      <dc:format>Article</dc:format>
      <dc:date>2024</dc:date>
      <dc:creator>Lin, Bertrand M. T.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Scheduling on parallel dedicated machines with job rejection</title>
      <pubDate>Thu, 07 Nov 2024 08:09:32 +0000</pubDate>
      <link>https://www.econbiz.de/Record/scheduling-on-parallel-dedicated-machines-with-job-rejection-mor-baruch/10015084888?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/scheduling-on-parallel-dedicated-machines-with-job-rejection-mor-baruch/10015084888?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2024</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Special issue on dynamic scheduling problems in theory and practice</title>
      <pubDate>Fri, 23 Aug 2024 13:38:54 +0000</pubDate>
      <link>https://www.econbiz.de/Record/special-issue-on-dynamic-scheduling-problems-in-theory-and-practice-lin-bertrand/10015049253?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/special-issue-on-dynamic-scheduling-problems-in-theory-and-practice-lin-bertrand/10015049253?sid=1534636718</guid>
      <author>Lin, Bertrand M. T.</author>
      <dc:format>Book / Working Paper</dc:format>
      <dc:date>2024</dc:date>
      <dc:creator>Lin, Bertrand M. T.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Single machine scheduling with step-learning</title>
      <pubDate>Fri, 23 Aug 2024 13:08:54 +0000</pubDate>
      <link>https://www.econbiz.de/Record/single-machine-scheduling-with-step-learning-atsmony-matan/10015049228?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/single-machine-scheduling-with-step-learning-atsmony-matan/10015049228?sid=1534636718</guid>
      <author>Atsmony, Matan</author>
      <dc:format>Article</dc:format>
      <dc:date>2024</dc:date>
      <dc:creator>Atsmony, Matan</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Dynamic scheduling problems in theory and practice</title>
      <pubDate>Fri, 23 Aug 2024 12:53:57 +0000</pubDate>
      <link>https://www.econbiz.de/Record/dynamic-scheduling-problems-in-theory-and-practice-gawiejnowicz-stanis%C5%82aw/10015049224?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/dynamic-scheduling-problems-in-theory-and-practice-gawiejnowicz-stanis%C5%82aw/10015049224?sid=1534636718</guid>
      <author>Gawiejnowicz, Stanisław</author>
      <dc:format>Article</dc:format>
      <dc:date>2024</dc:date>
      <dc:creator>Gawiejnowicz, Stanisław</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem</title>
      <pubDate>Thu, 11 Jul 2024 07:18:51 +0000</pubDate>
      <link>https://www.econbiz.de/Record/coordinating-scheduling-and-rejection-decisions-in-a-two-machine-flow-shop-scheduling-problem-shabtay-dvir/10014576760?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/coordinating-scheduling-and-rejection-decisions-in-a-two-machine-flow-shop-scheduling-problem-shabtay-dvir/10014576760?sid=1534636718</guid>
      <author>Shabtay, Dvir</author>
      <dc:format>Article</dc:format>
      <dc:date>2024</dc:date>
      <dc:creator>Shabtay, Dvir</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Due-Date assignment with acceptable lead-times on parallel machines</title>
      <pubDate>Tue, 02 Jul 2024 12:33:53 +0000</pubDate>
      <link>https://www.econbiz.de/Record/due-date-assignment-with-acceptable-lead-times-on-parallel-machines-mor-baruch/10014564252?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/due-date-assignment-with-acceptable-lead-times-on-parallel-machines-mor-baruch/10014564252?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2024</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A common due-date assignment problem with job rejection on parallel uniform machines</title>
      <pubDate>Wed, 12 Jun 2024 11:23:54 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-common-due-date-assignment-problem-with-job-rejection-on-parallel-uniform-machines-mosheiov-gur/10014546358?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-common-due-date-assignment-problem-with-job-rejection-on-parallel-uniform-machines-mosheiov-gur/10014546358?sid=1534636718</guid>
      <author>Mosheiov, Gur</author>
      <dc:format>Article</dc:format>
      <dc:date>2024</dc:date>
      <dc:creator>Mosheiov, Gur</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A note on batch scheduling on a two-machine flowshop with machine-dependent processing times</title>
      <pubDate>Wed, 11 Oct 2023 10:53:34 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-note-on-batch-scheduling-on-a-two-machine-flowshop-with-machine-dependent-processing-times-mosheiov-gur/10014372797?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-note-on-batch-scheduling-on-a-two-machine-flowshop-with-machine-dependent-processing-times-mosheiov-gur/10014372797?sid=1534636718</guid>
      <author>Mosheiov, Gur</author>
      <dc:format>Article</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Mosheiov, Gur</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence</title>
      <pubDate>Tue, 22 Aug 2023 12:48:04 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-note-maximizing-the-weighted-number-of-just-in-time-jobs-for-a-given-job-sequence-gerstl-enrique/10014329189?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-note-maximizing-the-weighted-number-of-just-in-time-jobs-for-a-given-job-sequence-gerstl-enrique/10014329189?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection</title>
      <pubDate>Tue, 16 May 2023 17:28:52 +0000</pubDate>
      <link>https://www.econbiz.de/Record/scheduling-to-maximize-the-weighted-number-of-on-time-jobs-on-parallel-machines-with-bounded-job-rejection-atsmony-matan/10014265758?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/scheduling-to-maximize-the-weighted-number-of-on-time-jobs-on-parallel-machines-with-bounded-job-rejection-atsmony-matan/10014265758?sid=1534636718</guid>
      <author>Atsmony, Matan</author>
      <dc:format>Article</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Atsmony, Matan</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity</title>
      <pubDate>Tue, 16 May 2023 17:28:52 +0000</pubDate>
      <link>https://www.econbiz.de/Record/minimizing-tardiness-scheduling-measures-with-generalized-due-dates-and-a-maintenance-activity-atsmony-matan/10014266466?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/minimizing-tardiness-scheduling-measures-with-generalized-due-dates-and-a-maintenance-activity-atsmony-matan/10014266466?sid=1534636718</guid>
      <author>Atsmony, Matan</author>
      <dc:format>Article</dc:format>
      <dc:date>2023</dc:date>
      <dc:creator>Atsmony, Matan</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates</title>
      <pubDate>Mon, 28 Nov 2022 13:16:28 +0000</pubDate>
      <link>https://www.econbiz.de/Record/on-the-tractability-of-hard-scheduling-problems-with-generalized-due-dates-with-respect-to-the-number-of-different-due-dates-mosheiov-gur/10013453936?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/on-the-tractability-of-hard-scheduling-problems-with-generalized-due-dates-with-respect-to-the-number-of-different-due-dates-mosheiov-gur/10013453936?sid=1534636718</guid>
      <author>Mosheiov, Gur</author>
      <dc:format>Article</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Mosheiov, Gur</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection</title>
      <pubDate>Fri, 18 Nov 2022 10:16:34 +0000</pubDate>
      <link>https://www.econbiz.de/Record/single-machine-scheduling-to-maximize-the-weighted-number-of-on-time-jobs-with-job-rejection-mor-baruch/10013445306?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/single-machine-scheduling-to-maximize-the-weighted-number-of-on-time-jobs-with-job-rejection-mor-baruch/10013445306?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work</title>
      <pubDate>Wed, 14 Sep 2022 09:01:32 +0000</pubDate>
      <link>https://www.econbiz.de/Record/single-machine-scheduling-with-common-assignable-due-date-due-window-to-minimize-total-weighted-early-and-late-work-shabtay-dvir/10013363872?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/single-machine-scheduling-with-common-assignable-due-date-due-window-to-minimize-total-weighted-early-and-late-work-shabtay-dvir/10013363872?sid=1534636718</guid>
      <author>Shabtay, Dvir</author>
      <dc:format>Article</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Shabtay, Dvir</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A greedy heuristic for solving scheduling problems with bounded rejection cost</title>
      <pubDate>Thu, 30 Jun 2022 12:31:30 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-greedy-heuristic-for-solving-scheduling-problems-with-bounded-rejection-cost-atsmony-matan/10013264824?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-greedy-heuristic-for-solving-scheduling-problems-with-bounded-rejection-cost-atsmony-matan/10013264824?sid=1534636718</guid>
      <author>Atsmony, Matan</author>
      <dc:format>Article</dc:format>
      <dc:date>2022</dc:date>
      <dc:creator>Atsmony, Matan</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates</title>
      <pubDate>Tue, 04 Jan 2022 13:18:56 +0000</pubDate>
      <link>https://www.econbiz.de/Record/minimizing-the-total-tardiness-and-job-rejection-cost-in-a-proportionate-flow-shop-with-generalized-due-dates-mor-baruch/10012792404?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/minimizing-the-total-tardiness-and-job-rejection-cost-in-a-proportionate-flow-shop-with-generalized-due-dates-mor-baruch/10012792404?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Scheduling with competing agents, total late work and job rejection</title>
      <pubDate>Mon, 26 Jul 2021 08:16:30 +0000</pubDate>
      <link>https://www.econbiz.de/Record/scheduling-with-competing-agents-total-late-work-and-job-rejection-freud-david/10012591168?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/scheduling-with-competing-agents-total-late-work-and-job-rejection-freud-david/10012591168?sid=1534636718</guid>
      <author>Freud, David</author>
      <dc:format>Article</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Freud, David</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Minimizing total late work on a single machine with generalized due-dates</title>
      <pubDate>Fri, 11 Jun 2021 09:16:20 +0000</pubDate>
      <link>https://www.econbiz.de/Record/minimizing-total-late-work-on-a-single-machine-with-generalized-due-dates-mosheiov-gur/10012533764?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/minimizing-total-late-work-on-a-single-machine-with-generalized-due-dates-mosheiov-gur/10012533764?sid=1534636718</guid>
      <author>Mosheiov, Gur</author>
      <dc:format>Article</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Mosheiov, Gur</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A note : flowshop scheduling with linear deterioration and job-rejection</title>
      <pubDate>Thu, 08 Apr 2021 10:01:17 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-note-flowshop-scheduling-with-linear-deterioration-and-job-rejection-mor-baruch/10012495043?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-note-flowshop-scheduling-with-linear-deterioration-and-job-rejection-mor-baruch/10012495043?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Minmax scheduling and due-window assignment with position-dependent processing times and job rejection</title>
      <pubDate>Thu, 08 Apr 2021 08:06:23 +0000</pubDate>
      <link>https://www.econbiz.de/Record/minmax-scheduling-and-due-window-assignment-with-position-dependent-processing-times-and-job-rejection-mosheiov-gur/10012494931?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/minmax-scheduling-and-due-window-assignment-with-position-dependent-processing-times-and-job-rejection-mosheiov-gur/10012494931?sid=1534636718</guid>
      <author>Mosheiov, Gur</author>
      <dc:format>Article</dc:format>
      <dc:date>2020</dc:date>
      <dc:creator>Mosheiov, Gur</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>The single machine CON problem with unavailability period</title>
      <pubDate>Mon, 15 Mar 2021 15:16:19 +0000</pubDate>
      <link>https://www.econbiz.de/Record/the-single-machine-con-problem-with-unavailability-period-gerstl-enrique/10012484626?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/the-single-machine-con-problem-with-unavailability-period-gerstl-enrique/10012484626?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2021</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Editorial: dynamic scheduling problems</title>
      <pubDate>Thu, 21 Jan 2021 09:31:19 +0000</pubDate>
      <link>https://www.econbiz.de/Record/editorial-dynamic-scheduling-problems-agnetis-alessandro/10012417543?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/editorial-dynamic-scheduling-problems-agnetis-alessandro/10012417543?sid=1534636718</guid>
      <author>Agnetis, Alessandro</author>
      <dc:format>Article</dc:format>
      <dc:date>2020</dc:date>
      <dc:creator>Agnetis, Alessandro</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Flowshop scheduling with learning effect and job rejection</title>
      <pubDate>Thu, 21 Jan 2021 09:31:19 +0000</pubDate>
      <link>https://www.econbiz.de/Record/flowshop-scheduling-with-learning-effect-and-job-rejection-mor-baruch/10012417545?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/flowshop-scheduling-with-learning-effect-and-job-rejection-mor-baruch/10012417545?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2020</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Single machine scheduling to maximize the number of on-time jobs with generalized due-dates</title>
      <pubDate>Tue, 16 Jun 2020 12:40:52 +0000</pubDate>
      <link>https://www.econbiz.de/Record/single-machine-scheduling-to-maximize-the-number-of-on-time-jobs-with-generalized-due-dates-gerstl-enrique/10012229009?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/single-machine-scheduling-to-maximize-the-number-of-on-time-jobs-with-generalized-due-dates-gerstl-enrique/10012229009?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2020</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Scheduling on a proportionate flowshop to minimise total late work</title>
      <pubDate>Tue, 31 Mar 2020 11:28:04 +0000</pubDate>
      <link>https://www.econbiz.de/Record/scheduling-on-a-proportionate-flowshop-to-minimise-total-late-work-gerstl-enrique/10012183685?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/scheduling-on-a-proportionate-flowshop-to-minimise-total-late-work-gerstl-enrique/10012183685?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion</title>
      <pubDate>Tue, 31 Mar 2020 11:28:04 +0000</pubDate>
      <link>https://www.econbiz.de/Record/semi-v-shape-property-for-two-machine-no-wait-proportionate-flow-shop-problem-with-tadc-criterion-kovalev-sergey/10012183687?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/semi-v-shape-property-for-two-machine-no-wait-proportionate-flow-shop-problem-with-tadc-criterion-kovalev-sergey/10012183687?sid=1534636718</guid>
      <author>Kovalev, Sergey</author>
      <dc:format>Article</dc:format>
      <dc:date>2019</dc:date>
      <dc:creator>Kovalev, Sergey</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Two-machine flow shop and open shop scheduling problems with a single maintenance window</title>
      <pubDate>Thu, 23 Aug 2018 05:58:56 +0000</pubDate>
      <link>https://www.econbiz.de/Record/two-machine-flow-shop-and-open-shop-scheduling-problems-with-a-single-maintenance-window-mosheiov-gur/10011890191?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/two-machine-flow-shop-and-open-shop-scheduling-problems-with-a-single-maintenance-window-mosheiov-gur/10011890191?sid=1534636718</guid>
      <author>Mosheiov, Gur</author>
      <dc:format>Article</dc:format>
      <dc:date>2018</dc:date>
      <dc:creator>Mosheiov, Gur</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Minmax scheduling with acceptable lead-times : extensions to position-dependent processing times, due-window and job rejection</title>
      <pubDate>Thu, 10 Aug 2017 12:54:59 +0000</pubDate>
      <link>https://www.econbiz.de/Record/minmax-scheduling-with-acceptable-lead-times-extensions-to-position-dependent-processing-times-due-window-and-job-rejection-gerstl-enrique/10011700716?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/minmax-scheduling-with-acceptable-lead-times-extensions-to-position-dependent-processing-times-due-window-and-job-rejection-gerstl-enrique/10011700716?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2017</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Scheduling with two competing agents to minimize total weighted earliness</title>
      <pubDate>Tue, 04 Jul 2017 14:39:57 +0000</pubDate>
      <link>https://www.econbiz.de/Record/scheduling-with-two-competing-agents-to-minimize-total-weighted-earliness-gerstl-enrique/10011669230?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/scheduling-with-two-competing-agents-to-minimize-total-weighted-earliness-gerstl-enrique/10011669230?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2017</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Minimizing maximum cost on a single machine with two competing agents and job rejection</title>
      <pubDate>Fri, 27 Jan 2017 07:56:46 +0000</pubDate>
      <link>https://www.econbiz.de/Record/minimizing-maximum-cost-on-a-single-machine-with-two-competing-agents-and-job-rejection-mor-baruch/10011588788?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/minimizing-maximum-cost-on-a-single-machine-with-two-competing-agents-and-job-rejection-mor-baruch/10011588788?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance</title>
      <pubDate>Wed, 27 Jul 2016 11:20:09 +0000</pubDate>
      <link>https://www.econbiz.de/Record/minsum-and-minmax-scheduling-on-a-proportionate-flowshop-with-common-flow-allowance-mor-baruch/10011508904?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/minsum-and-minmax-scheduling-on-a-proportionate-flowshop-with-common-flow-allowance-mor-baruch/10011508904?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A single machine scheduling problem to minimize total early work</title>
      <pubDate>Thu, 14 Jul 2016 12:00:12 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-single-machine-scheduling-problem-to-minimize-total-early-work-ben-yehoshua-yoav/10011502613?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-single-machine-scheduling-problem-to-minimize-total-early-work-ben-yehoshua-yoav/10011502613?sid=1534636718</guid>
      <author>Ben-Yehoshua, Yoav</author>
      <dc:format>Article</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>Ben-Yehoshua, Yoav</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A note on minimising total absolute deviation of job completion times on a two-machine no-wait proportionate flowshop</title>
      <pubDate>Tue, 09 Feb 2016 08:35:02 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-note-on-minimising-total-absolute-deviation-of-job-completion-times-on-a-two-machine-no-wait-proportionate-flowshop-ben-yehoshua-yoav/10011420688?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-note-on-minimising-total-absolute-deviation-of-job-completion-times-on-a-two-machine-no-wait-proportionate-flowshop-ben-yehoshua-yoav/10011420688?sid=1534636718</guid>
      <author>Ben-Yehoshua, Yoav</author>
      <dc:format>Article</dc:format>
      <dc:date>2015</dc:date>
      <dc:creator>Ben-Yehoshua, Yoav</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Scheduling with a due-window for acceptable lead-times</title>
      <pubDate>Fri, 29 Jan 2016 17:00:03 +0000</pubDate>
      <link>https://www.econbiz.de/Record/scheduling-with-a-due-window-for-acceptable-lead-times-gerstl-enrique/10011417482?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/scheduling-with-a-due-window-for-acceptable-lead-times-gerstl-enrique/10011417482?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2015</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Minimizing the number of early jobs on a proportionate flowshop</title>
      <pubDate>Fri, 29 Jan 2016 14:35:05 +0000</pubDate>
      <link>https://www.econbiz.de/Record/minimizing-the-number-of-early-jobs-on-a-proportionate-flowshop-mor-baruch/10011417421?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/minimizing-the-number-of-early-jobs-on-a-proportionate-flowshop-mor-baruch/10011417421?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2015</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A two-stage flexible flow shop problem with unit-execution-time jobs and batching</title>
      <pubDate>Fri, 12 Jun 2015 14:20:08 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-two-stage-flexible-flow-shop-problem-with-unit-execution-time-jobs-and-batching-gerstl-enrique/10011076778?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-two-stage-flexible-flow-shop-problem-with-unit-execution-time-jobs-and-batching-gerstl-enrique/10011076778?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2014</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines</title>
      <pubDate>Fri, 12 Jun 2015 14:09:25 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-two-stage-flow-shop-batch-scheduling-problem-with-the-option-of-using-not-all-machines-gerstl-enrique/10010869075?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-two-stage-flow-shop-batch-scheduling-problem-with-the-option-of-using-not-all-machines-gerstl-enrique/10010869075?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2013</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime</title>
      <pubDate>Fri, 12 Jun 2015 14:09:25 +0000</pubDate>
      <link>https://www.econbiz.de/Record/batch-scheduling-with-a-rate-modifying-maintenance-activity-to-minimize-total-flowtime-mor-baruch/10010869164?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/batch-scheduling-with-a-rate-modifying-maintenance-activity-to-minimize-total-flowtime-mor-baruch/10010869164?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2014</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Due-window assignment with identical jobs on parallel uniform machines</title>
      <pubDate>Fri, 12 Jun 2015 13:57:57 +0000</pubDate>
      <link>https://www.econbiz.de/Record/due-window-assignment-with-identical-jobs-on-parallel-uniform-machines-gerstl-enrique/10010664723?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/due-window-assignment-with-identical-jobs-on-parallel-uniform-machines-gerstl-enrique/10010664723?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2013</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A note: Multi-machine scheduling with general position-based deterioration to minimize total load</title>
      <pubDate>Fri, 12 Jun 2015 13:45:43 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-note-multi-machine-scheduling-with-general-position-based-deterioration-to-minimize-total-load-mosheiov-gur/10010597239?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-note-multi-machine-scheduling-with-general-position-based-deterioration-to-minimize-total-load-mosheiov-gur/10010597239?sid=1534636718</guid>
      <author>Mosheiov, Gur</author>
      <dc:format>Article</dc:format>
      <dc:date>2012</dc:date>
      <dc:creator>Mosheiov, Gur</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Scheduling a maintenance activity and due-window assignment based on common flow allowance</title>
      <pubDate>Fri, 12 Jun 2015 13:45:43 +0000</pubDate>
      <link>https://www.econbiz.de/Record/scheduling-a-maintenance-activity-and-due-window-assignment-based-on-common-flow-allowance-mor-baruch/10010597247?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/scheduling-a-maintenance-activity-and-due-window-assignment-based-on-common-flow-allowance-mor-baruch/10010597247?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2012</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Scheduling a deteriorating maintenance activity and due-window assignment</title>
      <pubDate>Fri, 27 Mar 2015 13:37:42 +0000</pubDate>
      <link>https://www.econbiz.de/Record/scheduling-a-deteriorating-maintenance-activity-and-due-window-assignment-mor-baruch/10010495418?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/scheduling-a-deteriorating-maintenance-activity-and-due-window-assignment-mor-baruch/10010495418?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2015</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A two-stage flexible flow shop problem with unit-execution-time jobs and batching</title>
      <pubDate>Thu, 18 Dec 2014 15:32:00 +0000</pubDate>
      <link>https://www.econbiz.de/Record/a-two-stage-flexible-flow-shop-problem-with-unit-execution-time-jobs-and-batching-gerstl-enrique/10010437989?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/a-two-stage-flexible-flow-shop-problem-with-unit-execution-time-jobs-and-batching-gerstl-enrique/10010437989?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2014</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime</title>
      <pubDate>Fri, 15 Aug 2014 15:22:26 +0000</pubDate>
      <link>https://www.econbiz.de/Record/batch-scheduling-with-a-rate-modifying-maintenance-activity-to-minimize-total-flowtime-mor-baruch/10010385217?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/batch-scheduling-with-a-rate-modifying-maintenance-activity-to-minimize-total-flowtime-mor-baruch/10010385217?sid=1534636718</guid>
      <author>Mor, Baruch</author>
      <dc:format>Article</dc:format>
      <dc:date>2014</dc:date>
      <dc:creator>Mor, Baruch</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>The optimal number of used machines in a two-stage flexible flowshop scheduling problem</title>
      <pubDate>Thu, 17 Apr 2014 16:38:21 +0000</pubDate>
      <link>https://www.econbiz.de/Record/the-optimal-number-of-used-machines-in-a-two-stage-flexible-flowshop-scheduling-problem-gerstl-enrique/10010339578?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/the-optimal-number-of-used-machines-in-a-two-stage-flexible-flowshop-scheduling-problem-gerstl-enrique/10010339578?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2014</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents</title>
      <pubDate>Fri, 14 Mar 2014 11:53:32 +0000</pubDate>
      <link>https://www.econbiz.de/Record/polynomial-time-solutions-for-scheduling-problems-on-a-proportionate-flowshop-with-two-competing-agents-mor/10010251712?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/polynomial-time-solutions-for-scheduling-problems-on-a-proportionate-flowshop-with-two-competing-agents-mor/10010251712?sid=1534636718</guid>
      <author>Mor, B.</author>
      <dc:format>Article</dc:format>
      <dc:date>2014</dc:date>
      <dc:creator>Mor, B.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Minmax due-date assignment with a time window for acceptable lead-times</title>
      <pubDate>Mon, 03 Feb 2014 10:28:22 +0000</pubDate>
      <link>https://www.econbiz.de/Record/minmax-due-date-assignment-with-a-time-window-for-acceptable-lead-times-gerstl-enrique/10010232556?sid=1534636718</link>
      <guid>https://www.econbiz.de/Record/minmax-due-date-assignment-with-a-time-window-for-acceptable-lead-times-gerstl-enrique/10010232556?sid=1534636718</guid>
      <author>Gerstl, Enrique</author>
      <dc:format>Article</dc:format>
      <dc:date>2013</dc:date>
      <dc:creator>Gerstl, Enrique</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
  </channel>
</rss>
