Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
Year of publication: |
16 October 2016
|
---|---|
Authors: | Mor, Baruch ; Mosheiov, Gur |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 254.2016, 2 (16.10.), p. 360-370
|
Subject: | Scheduling | Proportionate flowshop | Due-date assignment | Due-window assignment | Flow-allowance | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Heuristik | Heuristics |
-
Parallel machine scheduling problems with common flow-allowance
Mor, Baruch, (2012)
-
Heuristics for the stochastic single-machine problem with E/T costs
Lemos, R. F., (2015)
-
Improved algorithms for scheduling on proportionate flowshop with job-rejection
Mor, Baruch, (2019)
- More ...
-
Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime
Mor, Baruch, (2014)
-
Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
Mor, Baruch, (2010)
-
Scheduling a maintenance activity and due-window assignment based on common flow allowance
Mor, Baruch, (2012)
- More ...