Machine Scheduling

  • H. A. Eiselt
  • Carl-Louis Sandblom
Part of the Springer Texts in Business and Economics book series (STBE)


The subject of this chapter is the allocation of jobs (or tasks) to processors (or machines). These terms should be understood in the widest possible sense: in the case of a doctor treating patients the doctor is the processor and the patients represent the tasks, in the case of a tax auditor the auditor is the processor (or the “machine”), while the individual cases are the tasks to be processed. This allocation is to be made so as to optimize some objective. We will discuss a number of these objectives below.


Schedule Problem Flow Time Idle Time Flow Shop Maximal Lateness 
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.

Supplementary material


  1. Eiselt HA, Sandblom C-L (2004) Decision analysis, location models, and Scheduling Problems. Springer, Berlin/Heidelberg/New YorkGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Faculty of Business AdministrationUniversity of New BrunswickFrederictonCanada
  2. 2.Deptartment of Industrial EngineeringDalhousie UniversityHalifaxCanada

Personalised recommendations