Abstract
A fundamental scheduling problem is to determine a production start (ready) time based on customer-specified due dates. Typically, the objective is to delay the ready time in an attempt to minimize work-in-process inventory and maximize production system utilization. In many practical situations, highly variable service times complicate this problem. In such a case, the ready time implies a level of on-time completion confidence for each job. As the ready time increases, the on-time confidence decreases. This paper investigates the ready time/job confidence level tradeoff. A multi-objective model balances the ready time and confidence level maximization goals. The model involves combinatorial and numerical optimization and has an exceptionally complex state space. In view of these complexities, we investigate a pairwise interchange heuristic and a genetic algorithm search solution. Experimental results support solution through a process involving both the heuristic and the genetic algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Bausch, A multicriteria scheduling tool using a branch-and-bound algorithm, European Journal of Operational Research 61(1992)215–218.
J.E. Biegel and J.J. Davern, Genetic algorithms and job shop scheduling, Computers and Industrial Engineering 19(1990)81–91.
R.L. Daniels and R.J. Chambers, Multi-objective flow-shop scheduling, Naval Research Logistics 37(1990)981–995.
L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
F.G. Forst, A review of the static, stochastic scheduling job sequencing literature, Opsearch 21 (1984)127–144.
M. Gravel, J.M. Martel, R. Nadeau, W. Price and R. Tremblay, A multicriterion view of optimal resource allocation in job-shop production, European Journal of Operational Research 61(1992) 230–244.
T.J. Hodgson, R.E. King and P.M. Stanfield, Ready time scheduling with stochastic service times, Operations Research, to appear.
J.A. Hoogeveen and S.L. van de Velde, New lower bound approach for single machine multicriteria scheduling, Operations Research Letters 11(1992)39–44.
J.A. Joines and C.R. Houck, On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's, in: IEEE International Symposium on Evolutionary Computation, 1994, pp. 579–584.
R. Keeney and H. Raiffa, Decisions with Multiple Objectives, Wiley, New York, 1976.
G. Lawton, Genetic algorithms for scheduling optimization, AI Expert 7(1992)23–27.
Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, 1992.
R.P. Mohanty and M.K. Siddiq, Multiple projects-multiple resources constrained scheduling: A multi-objective analysis, Engineering Costs and Production Economics 18(1989)83–92.
P.M. Stanfield, Production scheduling under uncertainty, Ph.D. Dissertation, Department of Industrial Engineering, North Carolina State University, 1995.
P.M. Stanfield, R.E. King and J.A. Joines, Scheduling arrivals to a production system in a fuzzy environment, European Journal of Operational Research 93(1996)75–87.
R.H. Storer, S.D. Wu and R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling, Management Science 38(1992)1495–1509.
S. Uckun, K. Kawamura and Y. Miyabe, Managing genetic search in job shop scheduling, IEEE Expert 8(1993)15–24.
G. Weiss, Multiserver stochastic scheduling, in: Deterministic and Stochastic Scheduling: Proceedings of the NATO Study and Research on Theoretical Approaches to Scheduling Problems, D. Reidel, Dordrecht, Holland, 1982.
Rights and permissions
About this article
Cite this article
Stanfield, P.M., King, R.E. & Hodgson, T.J. Multi-objective stochastic scheduling of job ready times. Annals of Operations Research 70, 221–239 (1997). https://doi.org/10.1023/A:1018974221508
Issue Date:
DOI: https://doi.org/10.1023/A:1018974221508