A two-stage algorithm for scheduling preemptive jobs on parallel machines with minimum makespan criterion and requirements for limited renewable resources and existence of sequence dependent setup times is investigated. In the first stage of the algorithm a set of best elementary feasible plans is obtained through column generation. For the second stage we compare genetic algorithms for sequencing elementary plans, where various approximate criterions for calculation minimum makespan are used.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Dobson G., Karmarkar U., Rummel J.: Batching to minimize flow times on parallel heterogeneous machines. Mgmt Sci. 35 (1989) 607–613.
Figielska E.: Preemptive scheduling with changeovers: using column generation technique and genetic algorithm. Computers & Industrial Engineering 37 (1999) 8184.
Figielska E., Toczyáowski E.: Algorytm szeregowania podzielnych operacji na równolegáych procesorach przy ograniczeniach zasobów zuĪywalnychi odnawialnych. Optymalizacja w zagadnieniach kombinatorycznych, Wyd. WSM (1997) 18–31.
Hindi K. S., Toczyáowski E.: Detailed Scheduling of Batch Production in a Cell with Parallel Facilities and Common Renewable Resources. Computers and Industrial Engineering 28 (1995) 839–850.
Oliff M.D.: Disaggregate planning for parallel processors. IIE Trans 19 (1987) 215–219.
So K.: Some heuristics for scheduling jobs on parallel machines with setups. Mgmt Sci. 36 (1990) 467–475.
Toczyáowski E.: Niektóre metody strukturalne optymalizacji do sterowania w dyskretnych systemach wytwarzania. WNT (1989).
Toczyáowski E.: Algorithms for preemptive scheduling of independent tasks in the presence of general renewable and consumable resources. Zeszyty Nauk. AGH, Automatyka 59 (1991) 163–172.
Toczyáowski E.: Preemptive Scheduling of independent Tasks in the Presence of Setup Times and Renewable Resources. 17th International Symposium on Mathematical Programming ISMP'2000, 7–11 August 2000, Atlanta, USA.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 International Federation for Information Processing
About this paper
Cite this paper
Śliwiński, T., Toczyłowski, E. (2008). Preemptive Jobs Scheduling on Parallel Machines with Setup Times and Renewable Resources. In: Koch, T. (eds) Lean Business Systems and Beyond. IFIP – The International Federation for Information Processing, vol 257. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77249-3_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-77249-3_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-77248-6
Online ISBN: 978-0-387-77249-3
eBook Packages: Computer ScienceComputer Science (R0)