scispace - formally typeset
Journal ArticleDOI

Survey of scheduling research involving due date determination decisions

T.C.E. Cheng, +1 more
- 25 Jan 1989 - 
- Vol. 38, Iss: 2, pp 156-166
Reads0
Chats0
TLDR
A critical review of a particular segment of scheduling research in which the due to date assignment decision is of primary interest is presented, observing that while the static single- machine problem with constant or common due dates has been well researched, very little or no work has been done on the dynamic multi-machine problem with sophisticated due date assignment methods.
About
This article is published in European Journal of Operational Research.The article was published on 1989-01-25. It has received 498 citations till now. The article focuses on the topics: Job shop & Job shop scheduling.

read more

Citations
More filters

Sequencing and scheduling: algorithms and complexity

TL;DR: This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.
Journal ArticleDOI

Sequencing with Earliness and Tardiness Penalties: A Review

TL;DR: A framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date is provided and such features as parallel machines, complex penalty functions and distinct due dates are added.
Journal ArticleDOI

A review of scheduling research involving setup considerations

TL;DR: A comprehensive review of the literature on scheduling problems involving setup times (costs) classifies scheduling problems into batch and non-batch, sequence-independent and sequence-dependent setup, and categorizes the literature according to the shop environments of single machine, parallel machines, flowshops, and job shops.
Book ChapterDOI

Chapter 9 Sequencing and scheduling: Algorithms and complexity

TL;DR: Different types of sequencing and scheduling problems are discussed, and different types of algorithms and the concepts of complexity theory are described.
Journal ArticleDOI

Integrated Production and Outbound Distribution Scheduling: Review and Extensions

TL;DR: This paper presents a unified model representation scheme, classify existing models into several different classes, and for each class of the models give an overview of the optimality properties, computational tractability, and solution algorithms for the various problems studied in the literature.
References
More filters
Journal ArticleDOI

A Survey of Scheduling Rules

TL;DR: A summary of over 100 priority dispatching rules, a list of many references that analyze them, and a classification scheme are presented in this article, along with a classification of the rules.
Journal ArticleDOI

A state-of-the-art survey of dispatching rules for manufacturing job shop operations.

TL;DR: A review of the state of the art in the study of dispatching rules can be found in this paper, where a dispatching rule is used to select the next job to be processed from a set of jobs awaiting service.
Journal ArticleDOI

Sequencing Rules and Due-Date Assignments in a Job Shop

TL;DR: This paper surveys the tactical aspects of this interaction between sequencing priorities and the method of assigning due-dates, focusing primarily on average tardiness as a measure of scheduling effectiveness.
Journal ArticleDOI

Lot Sizes, Lead Times and In-Process Inventories

TL;DR: This paper examines the relationships between lot sizes and lead times and their implications for lot sizing and work-in-process inventories, for batch manufacturing shops with queues.
Journal ArticleDOI

Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

TL;DR: A polynomial bound scheduling algorithm is presented for the solution of this problem along with the proof of optimality, a numerical example and discuss some extensions.
Related Papers (5)