A learning and optimizing system for order acceptance and scheduling

Order acceptance and scheduling is an interesting scheduling problem when scheduling and acceptance decisions need to be handled simultaneously. The complexity of the problem causes difficulty for many solution methods. In this paper, we proposed a learning and optimizing system to deal with the order acceptance and scheduling problem with a single-machine and dependent setup times. The aim of this system is to combine the advantages of the hyper-heuristic for learning useful scheduling rules and the meta-heuristic for further refining the solutions from the obtained rules. The experiments show that the proposed system is very effective as compared to other heuristics proposed in the literature. The analyses also show the benefits of scheduling rules obtained by the hyper-heuristic, especially for large-scale problem instances.

[1]  Thomas Philip Runarsson,et al.  Supervised Learning Linear Priority Dispatch Rules for Job-Shop Scheduling , 2011, LION.

[2]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[3]  Mengjie Zhang,et al.  Automated Design of Production Scheduling Heuristics: A Review , 2016, IEEE Transactions on Evolutionary Computation.

[4]  Jun Zhang,et al.  Evolutionary Computation Meets Machine Learning: A Survey , 2011, IEEE Computational Intelligence Magazine.

[5]  Xiaonan Li,et al.  Discovering Dispatching Rules Using Data Mining , 2005, J. Sched..

[6]  Sujan Piya.  Dealing with customers enquiries simultaneously under contingent situation , 2015 .

[7]  Mark Johnston,et al.  Evolving Stochastic Dispatching Rules for Order Acceptance and Scheduling via Genetic Programming , 2013, Australasian Conference on Artificial Intelligence.

[8]  Mark Johnston,et al.  A Computational Study of Representations in Genetic Programming to Evolve Dispatching Rules for the Job Shop Scheduling Problem , 2013, IEEE Transactions on Evolutionary Computation.

[9]  Mark Johnston,et al.  Automatic Design of Scheduling Policies for Dynamic Multi-objective Job Shop Scheduling via Cooperative Coevolution Genetic Programming , 2014, IEEE Transactions on Evolutionary Computation.

[10]  Whm Henk Zijm,et al.  Order acceptance strategies in a production-to-order environment with setup times and due-dates , 1992 .

[11]  Muzaffer Kapanoglu,et al.  Learning IF-THEN priority rules for dynamic job shops using genetic algorithms , 2011 .

[12]  F. Sibel Salman,et al.  Order acceptance and scheduling decisions in make-to-order systems , 2010 .

[13]  Giovanni Romagnoli,et al.  Design and simulation of CONWIP in the complex flexible job shop of a Make-To-Order manufacturing firm , 2015 .

[14]  Walter O. Rom,et al.  Order acceptance using genetic algorithms , 2009, Comput. Oper. Res..

[15]  Lei Xu,et al.  Dynamic order acceptance and scheduling problem with sequence-dependent setup time , 2015 .

[16]  Qianqian Zhu,et al.  Subcontracting price schemes for order acceptance and scheduling , 2015 .

[17]  Liang Gao,et al.  A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates , 2013, J. Intell. Manuf..

[18]  T.C.E. Cheng,et al.  Order acceptance and scheduling in a two-machine flowshop , 2013 .

[19]  Thomas E. Morton,et al.  Selecting jobs for a heavily loaded shop with lateness penalties , 1996, Comput. Oper. Res..

[20]  Mark Johnston,et al.  Learning Reusable Initial Solutions for Multi-objective Order Acceptance and Scheduling Problems with Genetic Programming , 2013, EuroGP.

[21]  DebK.,et al.  A fast and elitist multiobjective genetic algorithm , 2002 .

[22]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[23]  Subramaniam Balakrishnan,et al.  Sequencing jobs on a single machine: A neural network approach , 2000, Eur. J. Oper. Res..

[24]  Bernd Scholz-Reiter,et al.  Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach , 2010, GECCO '10.

[25]  Stefan Minner,et al.  Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times , 2015, Eur. J. Oper. Res..

[26]  Michael Affenzeller,et al.  Priority Rule Generation with a Genetic Algorithm to Minimize Sequence Dependent Setup Costs , 2009, EUROCAST.

[27]  Graham Kendall,et al.  Exploring Hyper-heuristic Methodologies with Genetic Programming , 2009 .

[28]  Susan A. Slotnick,et al.  Order acceptance with weighted tardiness , 2007, Comput. Oper. Res..

[29]  Kazuo Miyashita,et al.  Job-shop scheduling with genetic programming , 2000 .

[30]  Purushothaman Damodaran,et al.  A branch and price solution approach for order acceptance and capacity planning in make-to-order operations , 2011, Eur. J. Oper. Res..

[31]  Wen-Hwa Yang,et al.  Survey of scheduling research involving setup times , 1999, Int. J. Syst. Sci..

[32]  Domagoj Jakobovic,et al.  Dynamic Scheduling with Genetic Programming , 2006, EuroGP.

[33]  Fuminori Oba,et al.  A robust scheduling rule using a Neural Network in dynamically changing job-shop environments , 2008, Int. J. Manuf. Technol. Manag..

[34]  Mengshi Lu,et al.  Integrated order selection and production scheduling under MTO strategy , 2011 .

[35]  Ceyda Oguz,et al.  A tabu search algorithm for order acceptance and scheduling , 2012, Comput. Oper. Res..

[36]  Semra Tunali,et al.  Setting order promising times in a supply chain network using hybrid simulation-analytical approach: An industrial case study , 2011, Simul. Model. Pract. Theory.

[37]  Bernd Scholz-Reiter,et al.  Hyper-heuristic Evolution of Dispatching Rules: A Comparison of Rule Representations , 2015, Evolutionary Computation.

[38]  Susan A. Slotnick,et al.  Order acceptance and scheduling: A taxonomy and review , 2011, Eur. J. Oper. Res..

[39]  Nhu Binh Ho,et al.  Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems , 2008, Comput. Ind. Eng..

[40]  Mark Johnston,et al.  A sequential genetic programming method to learn forward construction heuristics for order acceptance and scheduling , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[41]  Nicolas Zufferey,et al.  Metaheuristics for a scheduling problem with rejection and tardiness penalties , 2014, Journal of Scheduling.

[42]  Mark Johnston,et al.  Genetic programming for order acceptance and scheduling , 2013, 2013 IEEE Congress on Evolutionary Computation.

[43]  Graham Kendall,et al.  Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one , 2007, GECCO '07.

[44]  F. Fred Choobineh,et al.  A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times , 2006, Eur. J. Oper. Res..

[45]  T.C.E. Cheng,et al.  A modified artificial bee colony algorithm for order acceptance in two-machine flow shops , 2013 .

[46]  Jay B. Ghosh,et al.  Job selection in a heavily loaded shop , 1997, Comput. Oper. Res..

[47]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[48]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[49]  Robin O. Roundy,et al.  Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system: models and algorithms , 2005 .

[50]  T.C.E. Cheng,et al.  A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint , 2015 .

[51]  Reha Uzsoy,et al.  Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach , 2006, J. Sched..