Sequencing and scheduling: Algorithms and complexity
EL Lawler, JK Lenstra, AHGR Kan… - Handbooks in operations …, 1993 - Elsevier
Publisher Summary This chapter discusses different types of sequencing and scheduling
problems, and describes different types of algorithms and the concepts of complexity theory …
problems, and describes different types of algorithms and the concepts of complexity theory …
A survey of machine scheduling problems with blocking and no-wait in process
An important class of machine scheduling problems is characterized by a no-wait or
blocking production environment, where there is no intermediate buffer between machines …
blocking production environment, where there is no intermediate buffer between machines …
[BOOK][B] Scheduling
ML Pinedo - 2012 - Springer
Michael L. Pinedo Theory, Algorithms, and Systems Sixth Edition Page 1 Scheduling Michael L.
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …
[BOOK][B] Assignment problems: revised reprint
R Burkard, M Dell'Amico, S Martello - 2012 - SIAM
When SIAM asked us to prepare a new edition of this book after less than three years from
publication, we expected a light duty. Just the correction of some typos and imprecisions …
publication, we expected a light duty. Just the correction of some typos and imprecisions …
A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers
Energy-efficient scheduling of distributed production systems has become a common
practice among large companies with the advancement of economic globalization and …
practice among large companies with the advancement of economic globalization and …
Job-shop scheduling with blocking and no-wait constraints
A Mascis, D Pacciarelli - European Journal of Operational Research, 2002 - Elsevier
In this paper, we study the job-shop scheduling problem with blocking and/or no-wait
constraints. A blocking constraint models the absence of storage capacity between …
constraints. A blocking constraint models the absence of storage capacity between …
GOR Publications
R Kolisch, RE Burkard, B Fleischmann, K Inderfurth… - 2006 - Springer
Scheduling problems have been investigated since the late fifties. Two types of applications
have mainly motivated research in this area: project planning and machine scheduling …
have mainly motivated research in this area: project planning and machine scheduling …
A review of machine scheduling: Complexity, algorithms and approximability
The scheduling of computer and manufacturing systems has been the subject of extensive
research for over forty years. In addition to computers and manufacturing, scheduling theory …
research for over forty years. In addition to computers and manufacturing, scheduling theory …
Flowshop-scheduling problems with makespan criterion: a review
This paper is a complete survey of flowshop-scheduling problems and contributions from
early works of Johnson of to recent approaches of metaheuristics of 2004. It mainly …
early works of Johnson of to recent approaches of metaheuristics of 2004. It mainly …
The non-permutation flow-shop scheduling problem: a literature review
Abstract The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of
the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the …
the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the …