Mathematical Modeling of Scheduling Problems

Abstract The purpose of scheduling is to disaggregate the general production plan into time phased activities and determine a time table for activities which will optimize predetermined criteria. Minimizing flow times, keeping close conformance to deadlines, and efficient utilization of resources are the three broad classes of decision making criteria used in scheduling. In this paper, important criteria commonly used for evaluating scheduling decisions are identified. A scheduling cost model is developed for evaluating the cost of the schedule generated. Further, mathematical models are developed for generating optimal schedules in single machine, parallel machine, flow shop, flow shop with multiple processors, and job shop scheduling environments. The objective function in the mathematical models may consist of a single goal of minimizing the cost based upon a comprehensive scheduling cost model, or may consist of a set of goals composed of different scheduling criteria, both of which are modeled in thi...

[1]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[2]  Soumen Ghosh,et al.  A MILP model for the n-job, M-stage flowshop with sequence dependent set-up times , 1986 .

[3]  A. M. Geoffrion.  Duality in Nonlinear Programming: A Simplified Applications-Oriented Development , 1971 .

[4]  James P. Ignizio,et al.  A Generalized Goal Programming Approach to the Minimal Interference, Multicriteria N × 1 Scheduling Problem , 1984 .

[5]  R. Sumichrast,et al.  Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time , 1987 .

[6]  George B. Dantzig,et al.  A Machine-Job Scheduling Model , 1960 .

[7]  Willem Selen,et al.  A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem , 1986 .

[8]  Edward P. C. Kao,et al.  A multiple objective decision theoretic approach to one-machine scheduling problems , 1980, Comput. Oper. Res..

[9]  Christoph Haehling von Lanzenauer.  A Production Scheduling Model by Bivalent Linear Programming , 1970 .

[10]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[11]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[12]  Ludo Gelders,et al.  Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II - Computation and Structure , 1975, Oper. Res..

[13]  F. Durán.  A large mixed integer production and distribution program , 1987 .

[14]  S. Graves.  Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems , 1982 .

[15]  Yu-Chi Ho,et al.  Ordering scheduling problem in manufacturing systems , 1988 .

[16]  P. Mellor,et al.  A Review of Job Shop Scheduling , 1966 .

[17]  Suresh Chand,et al.  Single machine scheduling to minimize weighted earliness subject to no tardy jobs , 1988 .

[18]  C. Potts.  A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time , 1985 .

[19]  Uday S. Karmarkar,et al.  Batching to minimize flow times on one machine , 1987 .

[20]  R. Słowiński.  Preemptive scheduling of independent jobs on parallel machines subject to financial constraints , 1984 .

[21]  Rakesh K. Sarin,et al.  Scheduling with multiple performance measures: the one-machine case , 1986 .

[22]  Jatinder N. D. Gupta,et al.  Optimal Scheduling in a Multistage Flowshop , 1972 .

[23]  R. A. Dudek,et al.  Optimality Criteria for Flowshop Schedules , 1971 .