Philipp Melchiors, Rainer Kolisch & John J. Kanet. (2024) The performance of priority rules for the dynamic stochastic resource-constrained multi-project scheduling problem: an experimental investigation. Annals of Operations Research.
Crossref
Cristiane Ferreira, Gonçalo Figueira & Pedro Amorim. (2022) Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning. Omega 111, pages 102643.
Crossref
M. Thenarasu, K. Rameshkumar, Jacob Rousseau & S.P. Anbuudayasankar. (2022) Development and analysis of priority decision rules using MCDM approach for a flexible job shop scheduling: A simulation study. Simulation Modelling Practice and Theory 114, pages 102416.
Crossref
Jeffrey Schaller & Jorge M.S. Valente. (2020) Minimizing total earliness and tardiness in a nowait flow shop. International Journal of Production Economics 224, pages 107542.
Crossref
Vinod K.T.S. Prabagaran & O.A. Joseph. (2019) Dynamic due date assignment method. Journal of Manufacturing Technology Management 30:6, pages 987-1003.
Crossref
Rajan & Vineet Kumar. 2019. Soft Computing: Theories and Applications. Soft Computing: Theories and Applications
619
627
.
Kenneth R. Baker & Dan Trietsch. 2018. Principles of Sequencing and Scheduling. Principles of Sequencing and Scheduling
427
452
.
Joe Vargas & Roque Calvo. (2018) Joint Optimization of Process Flow and Scheduling in Service-Oriented Manufacturing Systems. Materials 11:9, pages 1559.
Crossref
C. Bierwirth & J. Kuhpfahl. (2017) Extended GRASP for the job shop scheduling problem with total weighted tardiness objective. European Journal of Operational Research 261:3, pages 835-848.
Crossref
Jurgen Branke, Su Nguyen, Christoph W. Pickardt & Mengjie Zhang. (2016) Automated Design of Production Scheduling Heuristics: A Review. IEEE Transactions on Evolutionary Computation 20:1, pages 110-124.
Crossref
Parinya KAWEEGITBUNDIT & Toru EGUCHI. (2016) Flexible job shop scheduling using genetic algorithm and heuristic rules. Journal of Advanced Mechanical Design, Systems, and Manufacturing 10:1, pages JAMDSM0010-JAMDSM0010.
Crossref
YK Lin & CS Chong. (2015) A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem. Journal of Industrial and Management Optimization 12:2, pages 703-717.
Crossref
Parinya Kaweegitbundit & Toru Eguchi. 2015. Advances in Production Management Systems: Innovative Production Management Towards Sustainable Growth. Advances in Production Management Systems: Innovative Production Management Towards Sustainable Growth
439
446
.
Philipp MelchiorsPhilipp Melchiors. 2015. Dynamic and Stochastic Multi-Project Planning. Dynamic and Stochastic Multi-Project Planning
51
71
.
Philipp MelchiorsPhilipp Melchiors. 2015. Dynamic and Stochastic Multi-Project Planning. Dynamic and Stochastic Multi-Project Planning
19
28
.
Iiro Harjunkoski, Christos T. Maravelias, Peter Bongers, Pedro M. Castro, Sebastian Engell, Ignacio E. Grossmann, John Hooker, Carlos Méndez, Guido Sand & John Wassick. (2014) Scope for industrial applications of production scheduling models and solution methods. Computers & Chemical Engineering 62, pages 161-193.
Crossref
Mitsunobu YODA, Toru EGUCHI & Takeshi MURAYAMA. (2014) Job shop scheduling for meeting due dates and minimizing overtime using genetic algorithm incorporating new priority rules. Journal of Advanced Mechanical Design, Systems, and Manufacturing 8:5, pages JAMDSM0071-JAMDSM0071.
Crossref
Przemysław Korytkowski, Tomasz Wiśniewski & Szymon Rymaszewski. (2013) An evolutionary simulation-based optimization approach for dispatching scheduling. Simulation Modelling Practice and Theory 35, pages 69-85.
Crossref
Shahid Maqsood, M. Khurshid Khan, Alastair Wood & I. Hussain. (2013) A Novel Heuristic Rule for Job Shop Scheduling. International Journal of Customer Relationship Marketing and Management 4:1, pages 28-40.
Crossref
Binchao Chen & Timothy I. Matis. (2013) A flexible dispatching rule for minimizing tardiness in job shop scheduling. International Journal of Production Economics 141:1, pages 360-365.
Crossref
Veronique Sels, Frederic Steen & Mario Vanhoucke. (2011) Applying a hybrid job shop procedure to a Belgian manufacturing company producing industrial wheels and castors in rubber. Computers & Industrial Engineering 61:3, pages 697-708.
Crossref
O.A. Joseph & R. Sridharan. (2011) Analysis of dynamic due-date assignment models in a flexible manufacturing system. Journal of Manufacturing Systems 30:1, pages 28-40.
Crossref
V. Vinod & R. Sridharan. (2011) Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system. International Journal of Production Economics 129:1, pages 127-146.
Crossref
Adil BaykasoğluMustafa Göçken & Lale Özbakir. (2009) Genetic Programming Based Data Mining Approach to Dispatching Rule Selection in a Simulated Job Shop. SIMULATION 86:12, pages 715-728.
Crossref
Tsung-Che Chiang. (2010) Model simplification for accelerating simulation-based evaluation of dispatching rules in wafer fabrication facilities. Model simplification for accelerating simulation-based evaluation of dispatching rules in wafer fabrication facilities.
J. Sigrist & C. Heitz. (2009) Enhancing local scheduling rules with a global benefit factor. Enhancing local scheduling rules with a global benefit factor.
Adil Baykasoğlu & Mustafa Göçken. (2009) Gene expression programming based due date assignment in a simulated job shop. Expert Systems with Applications 36:10, pages 12143-12150.
Crossref
Tsung-Che Chiang & Li-Chen Fu. (2009) Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times. European Journal of Operational Research 196:1, pages 78-92.
Crossref
Kenneth R. Baker & Dan Trietsch. 2009. Principles of Sequencing and Scheduling. Principles of Sequencing and Scheduling
249
371
.
Atif Shahzad & Nasser Mebarki. (2009) A Study of Tardiness Based Measures for Benchmark Priority Dispatching Rules used in Dynamic Job Shop. IFAC Proceedings Volumes 42:4, pages 1983-1988.
Crossref
V. Vinod & R. Sridharan. (2009) Development and analysis of scheduling decision rules for a dynamic flexible job shop production system: a simulation study. International Journal of Business Performance Management 11:1/2, pages 43.
Crossref
Adil Baykasoğlu, Mustafa Göçken & Zeynep D. Unutmaz. (2008) New approaches to due date assignment in job shops. European Journal of Operational Research 187:1, pages 31-45.
Crossref
Adil Baykasoğlu, Mustafa Göçken, Lale Özbakır & Sinem Kulluk. 2008. Modelling, Computation and Optimization in Information Systems and Management Sciences. Modelling, Computation and Optimization in Information Systems and Management Sciences
389
398
.
Roland Braune, Stefan Wagner & Michael Affenzeller. 2007. Computer Aided Systems Theory – EUROCAST 2007. Computer Aided Systems Theory – EUROCAST 2007
812
819
.
Tsung-Che Chiang & Li-Chen Fu. (2006) A Simulation Study on Dispatching Rules in Semiconductor Wafer Fabrication Facilities with Due Date-based Objectives. A Simulation Study on Dispatching Rules in Semiconductor Wafer Fabrication Facilities with Due Date-based Objectives.
Hiroshi Ohta & Toshihiro Nakatani. (2006) A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs. International Journal of Production Economics 101:1, pages 19-29.
Crossref
R. Alvarez-Valdes, A. Fuertes, J.M. Tamarit, G. Giménez & R. Ramos. (2005) A heuristic to schedule flexible job-shop in a glass factory. European Journal of Operational Research 165:2, pages 525-534.
Crossref
M.S Jayamohan & Chandrasekharan Rajendran. (2004) Development and analysis of cost-based dispatching rules for job shop scheduling. European Journal of Operational Research 157:2, pages 307-321.
Crossref
C. Kwak & Y. Yih. (2004) Data-Mining Approach to Production Control in the Computer-Integrated Testing Cell. IEEE Transactions on Robotics and Automation 20:1, pages 107-116.
Crossref
K.M Mohanasundaram, K Natarajan, G Viswanathkumar, P Radhakrishnan & C Rajendran. (2003) Scheduling rules for dynamic shops that manufacture multi-level jobs. Computers & Industrial Engineering 44:1, pages 119-131.
Crossref
Makoto Asano & Hiroshi Ohta. (2002) A heuristic for job shop scheduling to minimize total weighted tardiness. Computers & Industrial Engineering 42:2-4, pages 137-147.
Crossref
Toru Eguchi, Fuminori Oba & Satoru Toyooka. 2002. Initiatives of Precision Engineering at the Beginning of a Millennium. Initiatives of Precision Engineering at the Beginning of a Millennium
862
866
.
J. Ouenniche & J.W.M. Bertrand. (2001) The finite horizon economic lot sizing problem in job shops:. International Journal of Production Economics 74:1-3, pages 49-61.
Crossref
Zhiwei Zhu & Ronald B Heady. (2000) Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach. Computers & Industrial Engineering 38:2, pages 297-305.
Crossref
Vinı́cius Amaral Armentano & Cintia Rigão Scrich. (2000) Tabu search for minimizing total tardiness in a job shop. International Journal of Production Economics 63:2, pages 131-140.
Crossref
Chandrasekharan Rajendran & Oliver Holthaus. (1999) A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research 116:1, pages 156-170.
Crossref
Hyun Joong Yoon & Doo Yong Lee. (1999) Real-time scheduling of wafer fabrication with multiple product types. Real-time scheduling of wafer fabrication with multiple product types.
Guohua Wan & P.-C. Yen. (1999) A fuzzy logic system for dynamic job shop scheduling. A fuzzy logic system for dynamic job shop scheduling.
T.C.E. Cheng & J. Jiang. (1998) Job shop scheduling for missed due-date performance. Computers & Industrial Engineering 34:2, pages 297-307.
Crossref
K. Raj Kumar & T.T. Narendran. (1997) A heuristic for sequencing PCBs with due‐dates. International Journal of Operations & Production Management 17:5, pages 446-467.
Crossref
Oliver Holthaus & Chandrasekharan Rajendran. (1997) New dispatching rules for scheduling in a job shop ? An experimental study. The International Journal of Advanced Manufacturing Technology 13:2, pages 148-153.
Crossref
Oliver Holthaus & Chandrasekharan Rajendran. (1997) Efficient dispatching rules for scheduling in a job shop. International Journal of Production Economics 48:1, pages 87-105.
Crossref
Zesheng He, Taeyong Yang & Andy Tiger. (1996) An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling. European Journal of Operational Research 91:1, pages 99-117.
Crossref
Bahram Alidaee & K.R. Ramakrishnan. (1996) A computational experiment of covert-AU class of rules for single machine tardiness scheduling problem. Computers & Industrial Engineering 30:2, pages 201-209.
Crossref
Tien-Hsiang Sun, Chao-Weng Cheng & Li-Chen Fu. (1994) A Petri net based approach to modeling and scheduling for an FMS and a case study. IEEE Transactions on Industrial Electronics 41:6, pages 593-601.
Crossref
Taeyong Yang, Zesheng He & Kyu Kab Cho. (1994) An effective heuristic method for generalized job shop scheduling with due dates. Computers & Industrial Engineering 26:4, pages 647-660.
Crossref
Sebastian Engell, Frank Herrmann & Manfred Moser. 1994. Computer control of flexible manufacturing systems. Computer control of flexible manufacturing systems
75
107
.
David J. Robb & Edward A. Silver. (2007) Scheduling in a Management Context: Uncertain Processing Times and Non‐Regular Performance Measures*. Decision Sciences 24:6, pages 1085-1108.
Crossref
T.S. Raghu & Chandrasekharan Rajendran. (1993) An efficient dynamic dispatching rule for scheduling in a job shop. International Journal of Production Economics 32:3, pages 301-313.
Crossref
THOMAS R. ROHLEDER & GARY SCUDDER. (1993) A COMPARISON OF ORDER‐RELEASE AND DISPATCH RULES FOR THE DYNAMIC WEIGHTED EARLY/TARDY PROBLEM. Production and Operations Management 2:3, pages 221-238.
Crossref
JOHN J. KANET & ZHUOQUN ZHOU. (1993) A DECISION THEORY APPROACH TO PRIORITY DISPATCHING FOR JOB SHOP SCHEDULING. Production and Operations Management 2:1, pages 2-14.
Crossref
M. Moser & S. Engell. (1992) A survey of priority rules for FMS scheduling and their performance for the benchmark problem. A survey of priority rules for FMS scheduling and their performance for the benchmark problem.