Parallel machine problems with equal processing times: a survey
- 24 March 2011
- journal article
- research article
- Published by Springer Science and Business Media LLC in Journal of Scheduling
- Vol. 14 (5), 435-444
- https://doi.org/10.1007/s10951-011-0231-3
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Batch machine production with perishability time windows and limited batch sizeEuropean Journal of Operational Research, 2011
- Preemptive scheduling on uniform machines to minimize mean flow timeComputers & Operations Research, 2009
- Bicriterion scheduling with equal processing times on a batch processing machineComputers & Operations Research, 2009
- Scheduling unit length jobs with parallel nested machine processing set restrictionsComputers & Operations Research, 2006
- An introduction to multi-parameter complexity analysis of discrete problemsEuropean Journal of Operational Research, 2005
- A better algorithm for sequencing with release and delivery times on identical machinesJournal of Algorithms, 2003
- On the complexity of minimizing the number of late jobs in unit time open shopDiscrete Applied Mathematics, 2000
- Scheduling identical jobs on uniform parallel machinesStatistica Neerlandica, 1990
- Preemptive scheduling to minimize mean weighted flow timeInformation Processing Letters, 1990
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJournal of the ACM, 1978