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 state-of-the-art review of parallel-machine scheduling research
TCE Cheng, CCS Sin - European Journal of Operational Research, 1990 - Elsevier
A state-of-the-art review of parallel-machine scheduling research Page 1 European Journal of
Operational Research 47 (1990) 271-292 271 North-Holland Invited Review A state-of-the-art …
Operational Research 47 (1990) 271-292 271 North-Holland Invited Review A state-of-the-art …
Optimization and approximation in deterministic sequencing and scheduling: a survey
RL Graham, EL Lawler, JK Lenstra… - Annals of discrete …, 1979 - Elsevier
The theory of deterministic sequencing and scheduling has expanded rapidly during the
past years. In this paper we survey the state of the art with respect to optimization and …
past years. In this paper we survey the state of the art with respect to optimization and …
Resource-constrained project scheduling: Notation, classification, models, and methods
P Brucker, A Drexl, R Möhring, K Neumann… - European journal of …, 1999 - Elsevier
Project scheduling is concerned with single-item or small batch production where scarce
resources have to be allocated to dependent activities over time. Applications can be found …
resources have to be allocated to dependent activities over time. Applications can be found …
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 …
Scheduling parallel machines on-line
The problem of scheduling jobs on parallel machines is studied when (1) the existence of a
job is not known until its unknown release date and (2) the processing requirement of a job …
job is not known until its unknown release date and (2) the processing requirement of a job …
Recent developments in deterministic sequencing and scheduling: a survey
EL Lawler, JK Lenstra, AHG Rinnooy Kan - … in Durham, England, July 6–17 …, 1982 - Springer
The theory of deterministic sequencing and scheduling has expanded rapidly during the
past years. We survey the state of the art with respect to optimization and approximation …
past years. We survey the state of the art with respect to optimization and approximation …
On-line scheduling
J Sgall - Online algorithms: The state of the art, 2005 - Springer
We have seen a variety of on-line scheduling problems. Many of them are understood
satisfactorily, but there are also many interesting open problems. Studied scheduling …
satisfactorily, but there are also many interesting open problems. Studied scheduling …
Recent results in the theory of machine scheduling
EL Lawler - Mathematical programming the state of the art: Bonn …, 1983 - Springer
Recent Results in the Theory of Machine Scheduling Page 1 Recent Results in the Theory of
Machine Scheduling E. L. Lawler University of California, College of Engineering, Computer …
Machine Scheduling E. L. Lawler University of California, College of Engineering, Computer …
Preemptive scheduling of uniform machines by ordinary network flow techniques
A Federgruen, H Groenevelt - Management Science, 1986 - pubsonline.informs.org
We consider the problem of scheduling n jobs, each with a specific processing requirement,
release time and due date on m uniform parallel machines. It is shown that a feasible …
release time and due date on m uniform parallel machines. It is shown that a feasible …