Optimal booking of machines in a virtual job-shop with stochastic processing times to minimize total machine rental and job tardiness costs

We treat a virtual job-shop problem of sequencing n jobs on m unique machines. Each machine is outsourced with known renting cost per time unit. The job-operation processing times have random durations, and each job has its tardiness penalty function. The objective is to determine in advance the machine booking schedule that maximizes an economic gain. We present a simulation based on a cyclic coordinate descent search- algorithm and greedy priority dispatching rule that delivers a rent timetable that minimizes the expected total cost.

[1]  Roman Słowiński,et al.  Advances in project scheduling , 1989 .

[2]  Mats Engwall,et al.  The resource allocation syndrome: the prime challenge of multi-project management? , 2003 .

[3]  Jack R. Meredith,et al.  Project Management: A Managerial Approach , 1989 .

[4]  Dimitri Golenko-Ginzburg,et al.  CHANCE CONSTRAINED ORIENTED DISPATCHING RULES FOR FLEXIBLE JOB-SHOP SCHEDULING , 2004 .

[5]  James E. Smith,et al.  Options in the Real World: Lessons Learned in Evaluating Oil and Gas Investments , 1999, Oper. Res..

[6]  H. M. Soroush,et al.  Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs , 1999, Eur. J. Oper. Res..

[7]  Chandrasekharan Rajendran,et al.  A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..

[8]  Willy Herroelen,et al.  Project scheduling under uncertainty: Survey and research potentials , 2005, Eur. J. Oper. Res..

[9]  Dan Trietsch.  Scheduling flights at hub airports , 1993 .

[10]  Dimitri Golenko-Ginzburg,et al.  Optimal job-shop scheduling with random operations and cost objectives , 2002 .

[11]  John Bowers,et al.  Criticality in Resource Constrained Networks , 1995 .

[12]  Burton V. Dean,et al.  Multiproject staff scheduling with variable resource constraints , 1992 .

[13]  Vladimir Kats,et al.  A generalized control model for man-machine production systems with disturbances , 1997 .

[14]  Hossein Soroush,et al.  The stochastic single machine scheduling problem with earliness and tardiness costs , 1994 .

[15]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[16]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[17]  Reha Uzsoy,et al.  Executing production schedules in the face of uncertainties: A review and some future directions , 2005, Eur. J. Oper. Res..

[18]  Reha Uzsoy,et al.  Predictable scheduling of a job shop subject to breakdowns , 1998, IEEE Trans. Robotics Autom..

[19]  R. L. Daniels.  Chapter 4 – RESOURCE ALLOCATION AND MULTI-PROJECT SCHEDULING , 1989 .

[20]  Salah E. Elmaghraby,et al.  Optimal start times under stochastic activity durations , 2000 .

[21]  X. Chao,et al.  Operations scheduling with applications in manufacturing and services , 1999 .

[22]  Carlo Vercellis,et al.  Hierarchical models for multi-project planning and scheduling , 1993 .

[23]  R. Słowiński.  Multiobjective network scheduling with efficient use of renewable and nonrenewable resources , 1981 .

[24]  P. Chang,et al.  The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .

[25]  Dimitri Golenko-Ginzburg,et al.  Industrial job-shop scheduling with random operations and different priorities , 1995 .

[26]  Robert H. Storer,et al.  A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness , 1999, Oper. Res..

[27]  Robert H. Storer,et al.  Decomposition heuristics for robust job-shop scheduling , 1998, IEEE Trans. Robotics Autom..