Book•
Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
24 Mar 1982-
TL;DR: In this article, an introduction to the mathematics of the job shop is presented, with a focus on the sequential and scheduling aspects of the system. But this approach is not suitable for all job-shop scenarios.
Abstract: (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Journal of the Operational Research Society: Vol. 33, No. 9, pp. 862-862.
Citations
More filters
Book Chapter•
01 Jan 1996
TL;DR: This paper illustrates how the branching rules, dominance and bounding arguments of a new depth- first branch-and-bound procedure can be extended to a rich variety of related problems.
498Â citations
TL;DR: A classification, a characterization, and an evaluation of elementary priority rules are presented, and some priority rule-related model extensions are discussed, which are used in Shop Floor Control software systems.
Abstract: In this paper, we survey the literature on heuristic priority rule-based job shop scheduling. Priority rules have been intensively investigated over the last 30 years by means of simulation experiments. They are also used in Shop Floor Control software systems. We present a classification, a characterization, and an evaluation of elementary priority rules. Some priority rule-related model extensions are discussed.
448Â citations
TL;DR: It is shown that several key properties, used to design heuristic procedures, do not hold in the blocking and no-wait cases, while some of the most effective ideas used to develop branch and bound algorithms can be easily extended.
448Â citations
01 Jul 2006
TL;DR: This paper reviews the research literature on manufacturing process planning, scheduling as well as their integration, particularly on agent-based approaches to these difficult problems and discusses major issues in these research areas.
Abstract: Manufacturing process planning is the process of selecting and sequencing manufacturing processes such that they achieve one or more goals and satisfy a set of domain constraints. Manufacturing scheduling is the process of selecting a process plan and assigning manufacturing resources for specific time periods to the set of manufacturing processes in the plan. It is, in fact, an optimization process by which limited manufacturing resources are allocated over time among parallel and sequential activities. Manufacturing process planning and scheduling are usually considered to be two separate and distinct phases. Traditional optimization approaches to these problems do not consider the constraints of both domains simultaneously and result in suboptimal solutions. Without considering real-time machine workloads and shop floor dynamics, process plans may become suboptimal or even invalid at the time of execution. Therefore, there is a need for the integration of manufacturing process-planning and scheduling systems for generating more realistic and effective plans. After describing the complexity of the manufacturing process-planning and scheduling problems, this paper reviews the research literature on manufacturing process planning, scheduling as well as their integration, particularly on agent-based approaches to these difficult problems. Major issues in these research areas are discussed, and research opportunities and challenges are identified
424Â citations
Cites background from "Sequencing and Scheduling: An Intro..."
...More detailed discussions and analyses of scheduling problems can be found in [5], [29]....
[...]
TL;DR: In this paper, the authors present exact and approximate solution methods for crane scheduling in a static case and a simple static case is used as a building block to develop a better understanding of the dynamic problem with berth length limitations.
Abstract: This paper examines crane scheduling for ports. It starts with a simple static case and uses it as a building block to develop a better understanding of the dynamic problem with berth length limitations. The paper assumes that ships are divided into holds and that (usually) only one crane can work on a hold at a time. Cranes can be moved freely from hold to hold, and ships cannot depart until all their holds have been handled. In the most general case, ships arrive at different times and must queue for berthing space if the berths are full. The objective is to turn around (serve) all the ships, while minimizing their aggregate cost of delay. The paper presents exact and approximate solution methods for crane scheduling. The approximation methods are based on optimality principles and are easy to implement. The exact methods can only be used for a few ships. The paper includes examples, performance tests, and a discussion of port operations and further work.
398Â citations