Fifty years of scheduling: a survey of milestones

Abstract

Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms, and enhanced scheduling models.

New hard benchmark for flowshop scheduling problems minimising makespan

“…One of the major fields in operational research is scheduling. This is recognised by Potts and Strusevich (2009) where it is stated that hundreds of papers are published per year in all relevant journals in the field. In scheduling, the pioneering work is the paper of Johnson (1954) where the famous two machine flowshop scheduling problem with makespan minimisation criterion was studied.…”

Models and Algorithms for Production Planning and Scheduling in Foundries - Current State and Development Perspectives

“…Many researchers were motivated by the need to create scheduling models that comprise most of the features that arise in practice. However, Potts and Strusevich [16] in their extensive survey of scheduling process mention only a small number of such enhanced models that in fact are the extended version of the models introduced in earlier decades.…”

“…The enhanced scheduling models studied during the last few years include [16] Scheduling formulations focus on detailed modeling of actually feasible resources and constrains in a manufacturing environment. They typically include unit-task assignments, sequencing of tasks assigned to each unit, and inventory and utility constraints.…”

Programação da produção de gabaritos de montagem com restrições de adjacência na indústria aeronáutica

“…Essa limitação é aqui denominada de restrição de adjacência. A literatura que aborda problemas de programação de tarefas em máquinas é extensa (CONWAY;MAXWELL;MILLER, 1967;BAKER, 1974;COFFMAN, 1976;HAX;CANDEA, 1984;MORTON;PENTICO, 1993;NAHMIAS, 2001;PINEDO, 2005PINEDO, , 2008POTTS;STRUSEVICH, 2009, só para citar alguns). No entanto, os autores encontraram poucos estudos publicados que tratam de programação da produção com restrições de adjacência similares às consideradas neste trabalho.…”