Su Nguyen
ABSTRACT
Order acceptance and scheduling is an interesting and chal- lenging scheduling problem in which two decisions need to be handled simultaneously. While the exact methods are not efficient and sometimes impractical, existing meta-heuristics proposed in the literature still have troubles dealing with large problem instances. In this paper, a dispatching rule based genetic algorithm is proposed to combine the advan- tages of existing dispatching rules/heuristics, genetic algo- rithm and local search. The results indicates that the pro- posed methods are effective and efficient when compared to a number of existing heuristics with a wide range of problem instances.
- A. Allahverdi, J. N. Gupta, and T. Aldowaisan. A review of scheduling research involving setup considerations. Omega, 27(2):219--239, 1999.Google Scholar
Cross Ref
- U. Bilge, M. Kurtulan, and F. Kirac. A tabu search algorithm for the single machine total weighted tardiness problem. European Journal of Operational Research, 176(3):1423--1435, 2007.Google ScholarCross Ref
- W. Boejko, J. Grabowski, and M. Wodecki. Block approach-tabu search algorithm for single machine total weighted tardiness problem. Computers & Industrial Engineering, 50(1--2):1--14, 2006. Google ScholarDigital Library
- E. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J. Woodward. Exploring hyper-heuristic methodologies with genetic programming. In C. Mumford and L. Jain, editors, Computational Intelligence, volume 1 of Intelligent Systems Reference Library, pages 177--201. Springer Berlin Heidelberg, 2009.Google ScholarCross Ref
- B. Cesaret, C. Oguz, and F. S. Salman. A tabu search algorithm for order acceptance and scheduling. Computers & Operations Research, 39(6):1197--1205, 2012. Google ScholarDigital Library
- T. C. Chiang, Y. S. Shen, and L. C. Fu. A new paradigm for rule-based scheduling in the wafer probe centre. International Journal of Production Research, 46(15):4111--4133, 2008.Google ScholarCross Ref
- F. F. Choobineh, E. Mohebbi, and H. Khoo. A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 175(1):318--337, 2006.Google ScholarCross Ref
- U. Dorndorf and E. Pesch. Evolution based learning in a job shop scheduling environment. Computers and Operations Research, 22(1):25--40, 1995. Google ScholarDigital Library
- C. D. Geiger, R. Uzsoy, and H. Aytug. Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. Journal of Heuristics, 9(1):7--34, 2006. Google ScholarDigital Library
- J. B. Ghosh. Job selection in a heavily loaded shop. Computers & Operations Research, 24(2):141--145, 1997. Google ScholarDigital Library
- B. Giffler and G. L. Thompson. Algorithms for solving production-scheduling problems. Operations Research, 8:487--503, 1960. Google ScholarDigital Library
- E. Hart and P. Ross. A heuristic combination method for solving job-shop scheduling problems. In Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, PPSN V, pages 845--854, 1998. Google ScholarDigital Library
- T. Hildebrandt, J. Heger, and B. Scholz-Reiter. Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach. In GECCO'10: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pages 257--264, 2010. Google ScholarDigital Library
- S. Huang, M. Lu, and G. Wan. Integrated order selection and production scheduling under to strategy. International Journal of Production Research, 49(13):4085--4101, 2011.Google ScholarCross Ref
- S. Kreipl. A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling, 3:125--138, 2000.Google ScholarCross Ref
- Y. H. Lee, K. Bhaskaran, and M. Pinedo. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29(1):45--52, 1997.Google ScholarCross Ref
- S. Mestry, P. Damodaran, and C.-S. Chen. A branch and price solution approach for order acceptance and capacity planning in make-to-order operations. European Journal of Operational Research, 211(3):480--495, 2011.Google ScholarCross Ref
- S. Nguyen, M. Zhang, and M. Johnston. A sequential genetic programming method to learn forward construction heuristics for order acceptance and scheduling. In D. Liu, A. Hussain, Z. Zeng, and N. Zhang, editors, 2014 IEEE Congress on Evolutionary Computation (CEC), pages 1824--1831. IEEE Press, Piscataway, NJ, 2014.Google ScholarCross Ref
- S. Nguyen, M. Zhang, M. Johnston, and K. C. Tan. A coevolution genetic programming method to evolve scheduling policies for dynamic multi-objective job shop scheduling problems. CEC'12: IEEE Congress on Evolutionary Computation, pages 3332--3339, 2012.Google ScholarCross Ref
- S. Nguyen, M. Zhang, M. Johnston, and K. C. Tan. A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem. IEEE Transactions on Evolutionary Computation, 17(5):621--639, 2013. Google ScholarDigital Library
- S. Nguyen, M. Zhang, M. Johnston, and K. C. Tan. Learning reusable initial solutions for multi-objective order acceptance and scheduling problems with genetic programming. In EuroGP'13: Proceedings of the 16th European Conference on Genetic Programming, pages 157--168, 2013. Google ScholarDigital Library
- C. Oguz, F. Sibel Salman, and Z. Bilginturk Yalcin. Order acceptance and scheduling decisions in make-to-order systems. International Journal of Production Economics, 125(1):200--211, 2010.Google ScholarCross Ref
- S. Petrovic, C. Fayad, D. Petrovic, E. Burke, and G. Kendall. Fuzzy job shop scheduling with lot-sizing. Annals of Operations Research, 159:275--292, 2008.Google ScholarCross Ref
- M. L. Pinedo. Scheduling: Theory, Algorithms, and Systems. Springer, 3rd edition, 2008. Google ScholarDigital Library
- S. G. Ponnambalam, V. Ramkumar, and N. Jawahar. A multiobjective genetic algorithm for job shop scheduling. Production Planning and Control, 12(8), 2001.Google Scholar
- W. O. Rom and S. A. Slotnick. Order acceptance using genetic algorithms. Computers & Operations Research, 36(6):1758--1767, 2009. Google ScholarDigital Library
- R. Roundy, D. Chen, P. Chen, M. Cakanyildirim, M. B. Freimer, and V. Melkonian. Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system: models and algorithms. IIE Transactions, 37(12):1093--1105, 2005.Google ScholarCross Ref
- M. Selim Akturk and D. Ozdemir. An exact approach to minimizing total weighted tardiness with release dates. IIE Transactions, 32(11):1091--1101, 2000.Google ScholarCross Ref
- S. A. Slotnick. Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research, 212(1):1--11, 2011.Google ScholarCross Ref
- S. A. Slotnick and T. E. Morton. Selecting jobs for a heavily loaded shop with lateness penalties. Computers & Operations Research, 23(2):131--140, 1996. Google ScholarDigital Library
- S. A. Slotnick and T. E. Morton. Order acceptance with weighted tardiness. Computers & Operations Research, 34(10):3029--3042, 2007. Google ScholarDigital Library
- R. H. Storer, S. D. Wu, and R. Vaccari. New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38(10):1495--1509, 1992. Google ScholarDigital Library
- J. C. Tay and N. B. Ho. Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computer & Industrial Engineering, 54:453--473, 2008. Google ScholarDigital Library
- J. A. Vázquez-Rodríguez and S. Petrovic. A new dispatching rule based genetic algorithm for the multi-objective job shop problem. Journal of Heuristics, 16(6):771--793, 2010. Google ScholarDigital Library
- X. Wang, X. Xie, and T. Cheng. A modified artificial bee colony algorithm for order acceptance in two-machine flow shops. International Journal of Production Economics, 2012. DOI:10.1016/j.ijpe.2012.06.003.Google Scholar
- X. Wang, X. Xie, and T. Cheng. Order acceptance and scheduling in a two-machine flowshop. International Journal of Production Economics, 2012. DOI:10.1016/j.ijpe.2012.08.020.Google Scholar
- F. A. W. Wester, J. Wijngaard, and W. R. M. Zijm. Order acceptance strategies in a production-to-order environment with setup times and due-dates. International Journal of Production Research, 30(6):1313--1326, 1992.Google ScholarCross Ref
- W. H. Yang. Survey of scheduling research involving setup times. International Journal of Systems Science, 30(2):143--155, 1999.Google ScholarCross Ref
- H. Zhou, W. Cheung, and L. C. Leung. Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm. European Journal of Operational Research, 194(3):637--649, 2009.Google ScholarCross Ref
Index Terms
- A Dispatching rule based Genetic Algorithm for Order Acceptance and Scheduling
Recommendations
Unrelated parallel machine scheduling using local search
Simulated annealing and taboo search are well-established local search methods for obtaining approximate solutions to a variety of combinatorial optimization problems. More recently, genetic algorithms have also been applied. However, there are few ...
A hybrid genetic algorithm with local search approach for E/T scheduling problems on identical parallel machines
GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computationThis work considers scheduling problems on single and parallel machines with arbitrary processing times and independent jobs, to minimize the sum of earliness-tardiness penalties. A Genetic Algorithm with a smart local search approach is presented, a 2-...
Complex scheduling problems using an optimization methodology
Scheduling operations problems arise in diverse areas such as flexible manufacturing, production planning and scheduling, logistics, supply chain problem, etc. A common feature of many of these problems is that no efficient solution algorithms are known ...
Comments