Parallel Machine Selection and Job Scheduling to Minimize Sum of Machine Holding Cost, Total Machine Time Costs, and Total Tardiness Costs

This paper is concerned with scheduling of a set of single-operation tasks on a set of parallel machines where subcontracting is allowed. The objective is to choose a subset of machines/subcontractors from a set of available machines/subcontractors to perform all jobs to minimize sum of several costs. Processing time of jobs is assumed to be equal. Lower and upper bound for number of jobs assigned to a machine/subcontractor is considered. We first present a comprehensive survey of applications and models. We show special case of the problem when lower bound for number of jobs assigned to each machine/subcontractor is equal to zero is equivalent to single-sink fixed-charge transportation problem (SSFCT). This proves NP-hardness of the problem. Efficient dynamic programming algorithm for this special case is presented. Complicating issues regarding the general case with nonzero lower bounds for number of jobs assigned to machines/subcontractors is discussed. We transfer the general problem to multiple choice knapsack problem (MCKP) that can be solved efficiently using available algorithms. Several new problems are introduced. Complexity of each problem is resolved. Transformation to MCKP is provided that allows available algorithms to solve the problems. The main contribution of this paper is to establish theoretical results regarding the solution of these difficult problems.

[1]  Bahram Alidaee,et al.  Greedy solutions of selection and ordering problems , 2001, Eur. J. Oper. Res..

[2]  Pinar Keskinocak,et al.  OR Practice - Catch-Up Scheduling for Childhood Vaccination , 2009, Oper. Res..

[3]  Thomas F. La Porta,et al.  Who, When, Where: Timeslot Assignment to Mobile Clients , 2012, IEEE Trans. Mob. Comput..

[4]  Chak-Kuen Wong,et al.  Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation , 1975, SIAM J. Comput..

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

[6]  Byung-Cheon Choi,et al.  Two-stage production scheduling with an outsourcing option , 2011, Eur. J. Oper. Res..

[7]  Daniel Dajun Zeng,et al.  Effective Role Resolution in Workflow Management , 2005, INFORMS J. Comput..

[8]  Samir Khuller,et al.  To fill or not to fill: The gas station problem , 2007, TALG.

[9]  Konstantin Kogan,et al.  Supply Chain With Inventory Review and Dependent Demand Distributions: Dynamic Inventory Outsourcing , 2010, IEEE Transactions on Automation Science and Engineering.

[10]  Debasish Ghose,et al.  Two-agent cooperative search using game models with endurance-time constraints , 2010 .

[11]  G. Laporte,et al.  Discrete Optimization The multi-depot vehicle routing problem with inter-depot routes , 2007 .

[12]  Andrew Wirth,et al.  Equal processing and equal setup time cases of scheduling parallel machines with a single server , 2004, Comput. Oper. Res..

[13]  Nukala Viswanadham,et al.  Partner selection and synchronized planning in dynamic manufacturing networks , 2003, IEEE Trans. Robotics Autom..

[14]  Pinar Keskinocak,et al.  Catch-up Scheduling for Childhood Vaccination , 2008 .

[15]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[16]  Daniel Oron,et al.  Due‐window assignment with unit processing‐time jobs , 2004 .

[17]  Arun Kumar,et al.  Vehicle Routing with Cross Docks, Split Deliveries, and Multiple Use of Vehicles , 2011 .

[18]  Michael Pinedo,et al.  Planning and Scheduling in Supply Chains: An Overview of Issues in Practice , 2004 .

[19]  Peter Eades,et al.  On Optimal Trees , 1981, J. Algorithms.

[20]  Rubén Ruiz,et al.  Scheduling unrelated parallel machines with optional machines and jobs selection , 2012, Comput. Oper. Res..

[21]  Jirí Sgall,et al.  Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines , 1999, ESA.

[22]  Celia A. Glass,et al.  Batch machine production with perishability time windows and limited batch size , 2011, Eur. J. Oper. Res..

[23]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[24]  Shieu-Hong Lin,et al.  Finding Optimal Refueling Policies in Transportation Networks , 2008, AAIM.

[25]  Bopaya Bidanda,et al.  Minimising total cost with regular and emergency outsourcing sources: a neuro-dynamic programming approach , 2009 .

[26]  Seyed Hessameddin Zegordi,et al.  A Multi-Population Genetic Algorithm for Transportation Scheduling , 2009 .

[27]  Ik Sun Lee,et al.  Single machine scheduling with outsourcing allowed , 2008 .

[28]  Vadim G. Timkovsky,et al.  Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines? , 1998, Discret. Appl. Math..

[29]  Johnny C. Ho,et al.  Minimizing the average tardiness: the case of outsource machines , 2008 .

[30]  Vadim G. Timkovsky,et al.  Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity , 2003, Eur. J. Oper. Res..

[31]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..

[32]  Xiangtong Qi,et al.  Outsourcing and production scheduling for a two-stage flow shop , 2011 .

[33]  T. C. Edwin Cheng,et al.  Bicriterion scheduling with equal processing times on a batch processing machine , 2009, Comput. Oper. Res..

[34]  Johnny C. Ho,et al.  Generating Pareto schedules with outsource and internal parallel resources , 2006 .

[35]  Gur Mosheiov,et al.  Minmax earliness-tardiness costs with unit processing time jobs , 2001, Eur. J. Oper. Res..

[36]  Tzu-Liang Tseng,et al.  Minimizing the normalized sum of square for workload deviations on m parallel processors , 2009, Comput. Ind. Eng..

[37]  Weiya Zhong,et al.  Single machine scheduling problems with subcontracting options , 2011, Journal of Combinatorial Optimization.

[38]  Jonathan F. Bard,et al.  A multi-period machine assignment problem , 2006, Eur. J. Oper. Res..

[39]  Weiming Shen,et al.  Agent-based distributed manufacturing process planning and scheduling: a state-of-the-art survey , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[40]  Mark S. Daskin,et al.  Improving fleet utilization for carriers by interval scheduling , 2012, Eur. J. Oper. Res..

[41]  Johnny C. Ho,et al.  Parallel machine scheduling problems considering regular measures of performance and machine cost , 2010, J. Oper. Res. Soc..

[42]  Gur Mosheiov,et al.  Scheduling unit processing time jobs on an m-machine flow-shop , 2003, J. Oper. Res. Soc..

[43]  Roberto Musmanno,et al.  Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions , 2004, J. Math. Model. Algorithms.

[44]  George L. Vairaktarakis,et al.  The Value of Processing Flexibility in Multipurpose Machines , 2003 .

[45]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[46]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[47]  Frank Werner,et al.  Minimizing the number of machines for scheduling jobs with equal processing times , 2009, Eur. J. Oper. Res..

[48]  Peter Brucker,et al.  Scheduling jobs with equal processing times and time windows on identical parallel machines , 2008, J. Sched..

[49]  Erol Gelenbe,et al.  The stability problem of broadcast packet switching computer networks , 1974, Acta Informatica.

[50]  Lu Zhen,et al.  A Decision Model on Production Planning With Outsourcing , 2012, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[51]  Sergey V. Sevastianov,et al.  An introduction to multi-parameter complexity analysis of discrete problems , 2005, Eur. J. Oper. Res..

[52]  David Naso,et al.  Reactive Scheduling of a Distributed Network for the Supply of Perishable Products , 2007, IEEE Transactions on Automation Science and Engineering.

[53]  Xiangtong Qi,et al.  Coordinated Logistics Scheduling for In-House Production and Outsourcing , 2008, IEEE Transactions on Automation Science and Engineering.

[54]  Nukala Viswanadham,et al.  Strategic sourcing and collaborative planning in Internet-enabled supply chain networks producing multigeneration products , 2005, IEEE Transactions on Automation Science and Engineering.

[55]  N. Alon,et al.  Approximation schemes for scheduling on parallel machines , 1998 .

[56]  Jayme Luiz Szwarcfiter,et al.  Scheduling problem with multi-purpose parallel machines , 2014, Discret. Appl. Math..

[57]  Chung-Lun Li,et al.  Scheduling with processing set restrictions: A survey , 2008 .

[58]  Giuseppe Paletta,et al.  A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria , 2012, Comput. Oper. Res..

[59]  Richard F. Hartl,et al.  A variable neighborhood search for the capacitated arc routing problem with intermediate facilities , 2008, J. Heuristics.

[60]  Frank Werner,et al.  Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey , 2004, Math. Comput. Model..

[61]  Jinwoo Park,et al.  A new approach to job shop scheduling problems with due date constraints considering operation subcontracts , 2005 .

[62]  Gerd Finke,et al.  Minimizing the number of machines for minimum length schedules , 2009, Eur. J. Oper. Res..

[63]  Zhi-Long Chen,et al.  Scheduling with subcontracting options , 2008 .

[64]  Marc E. Posner,et al.  High Multiplicity in Earliness-Tardiness Scheduling , 2000, Oper. Res..

[65]  Manoj Kumar Tiwari,et al.  The relevance of outsourcing and leagile strategies in performance optimization of an integrated process planning and scheduling model , 2009 .

[66]  Gur Mosheiov,et al.  A note: a due-window assignment problem on parallel identical machines , 2011, J. Oper. Res. Soc..

[67]  Hadi Mokhtari,et al.  Production scheduling with outsourcing scenarios: a mixed integer programming and efficient solution procedure , 2012 .

[68]  Frank Werner,et al.  Parallel machine problems with equal processing times: a survey , 2011, J. Sched..

[69]  Dong Cao,et al.  Parallel machine selection and job scheduling to minimize machine cost and job tardiness , 2005, Comput. Oper. Res..

[70]  Guochuan Zhang,et al.  Scheduling with a minimum number of machines , 2009, Oper. Res. Lett..

[71]  Alan M. Frieze,et al.  On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.

[72]  Ik Sun Lee,et al.  Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed , 2008, Eur. J. Oper. Res..

[73]  Feng Chu,et al.  Single-Item Dynamic Lot-Sizing Models With Bounded Inventory and Outsourcing , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[74]  Wieslaw Kubiak,et al.  Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors , 2009, Discret. Optim..

[75]  Robert R. Goldberg,et al.  Partitioning under the Lp norm , 2000, Eur. J. Oper. Res..

[76]  Bahram Alidaee,et al.  A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem , 2005, Transp. Sci..

[77]  Edward G. Coffman,et al.  Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices , 1976, J. ACM.

[78]  Y. Narahari,et al.  Nonconvex piecewise linear knapsack problems , 2009, Eur. J. Oper. Res..

[79]  Celia A. Glass,et al.  Scheduling unit length jobs with parallel nested machine processing set restrictions , 2006, Comput. Oper. Res..

[80]  M. K. Tiwari,et al.  Modeling the planning and scheduling across the outsourcing supply chain: a Chaos-based fast Tabu–SA approach , 2008 .

[81]  Yossi Azar,et al.  Load balancing of temporary tasks in the lp norm , 2006, Theor. Comput. Sci..

[82]  George Steiner,et al.  Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs , 2009, Oper. Res..