Citations (91)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (11)
Joost Berkhout, Eric Pauwels, Rob van der Mei, Jan Stolze & Siem Broersen. (2021) Short-term production scheduling with non-triangular sequence-dependent setup times and shifting production bottlenecks. International Journal of Production Research 59:3, pages 727-751.
Read now
Read now
Claude Yugma, Stéphane Dauzère-Pérès, Christian Artigues, Alexandre Derreumaux & Olivier Sibille. (2012) A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing. International Journal of Production Research 50:8, pages 2118-2132.
Read now
Read now
C.-H. Liu. (2009) Lot streaming for customer order scheduling problem in job shop environments. International Journal of Computer Integrated Manufacturing 22:9, pages 890-907.
Read now
Read now
Yan Zuo, Hanyu Gu & Yugeng Xi. (2008) Study on constraint scheduling algorithm for job shop problems with multiple constraint machines. International Journal of Production Research 46:17, pages 4785-4801.
Read now
Read now
Jen Huei Chang
& Huan Neng Chiu. (2005) A comprehensive review of lot streaming. International Journal of Production Research 43:8, pages 1515-1536.
Read now
Read now
R. Kumar, M. K. Tiwari & V. Allada
. (2004) Modelling and rescheduling of a re-entrant wafer fabrication line involving machine unreliability. International Journal of Production Research 42:21, pages 4431-4455.
Read now
Read now
P Corry & E Kozan. (2004) Job scheduling with technical constraints. Journal of the Operational Research Society 55:2, pages 160-169.
Read now
Read now
H. Aytug, K. Kempf & R. Uzsoy. (2003) Measures of subproblem criticality in decomposition algorithms for shop scheduling. International Journal of Production Research 41:5, pages 865-882.
Read now
Read now
Manfred Gronalt. (2002) Work order release and input sequencing for a printed circuit board assembly cell. Production Planning & Control 13:7, pages 591-601.
Read now
Read now
MARCOS SINGER & MICHAEL PINEDO. (1998) A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Transactions 30:2, pages 109-118.
Read now
Read now
Tien-Chun Hsu & Shu-Hsing Chung. (1997) 排程寬裕之導出與應用. Journal of the Chinese Institute of Industrial Engineers 14:2, pages 123-133.
Read now
Read now
Articles from other publishers (80)
Murat Güngör. (2023) A note on the shifting bottleneck procedure for job shop scheduling. Journal of Scheduling 26:4, pages 399-402.
Crossref
Crossref
Benjamin Anthouard, Valeria Borodin, Stephane Dauzere-Peres, Quentin Christ & Renaud Roussel. (2022) Criticality Measures for Time Constraint Tunnels in Semiconductor Manufacturing. Criticality Measures for Time Constraint Tunnels in Semiconductor Manufacturing.
Shahed Mahmud, Alireza Abbasi, Ripon K. Chakrabortty & Michael J. Ryan. (2021) Multi-operator communication based differential evolution with sequential Tabu Search approach for job shop scheduling problems. Applied Soft Computing 108, pages 107470.
Crossref
Crossref
Raja Awais Liaqait, Shermeen Hamid, Salman Sagheer Warsi & Azfar Khalid. (2021) A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0. Sustainability 13:14, pages 7684.
Crossref
Crossref
Wenda Zhang, Jason J. Sauppe & Sheldon H. Jacobson. (2021) An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints. INFORMS Journal on Computing 33:3, pages 1091-1102.
Crossref
Crossref
Jian Zhang, Guofu Ding, Yisheng Zou, Shengfeng Qin & Jianlin Fu. (2017) Review of job shop scheduling research and its new perspectives under Industry 4.0. Journal of Intelligent Manufacturing 30:4, pages 1809-1830.
Crossref
Crossref
Kenneth R. Baker & Dan Trietsch. 2018. Principles of Sequencing and Scheduling. Principles of Sequencing and Scheduling
399
425
.
Kashif Akram, Khurram Kamal & Alam Zeb. (2016) Fast simulated annealing hybridized with quenching for solving job shop scheduling problem. Applied Soft Computing 49, pages 510-523.
Crossref
Crossref
Yi Tan, Torsten Hildebrandt & Bernd Scholz-Reiter. (2015) Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem. Journal of Scheduling 19:4, pages 429-452.
Crossref
Crossref
Michael L. PinedoMichael L. Pinedo. 2016. Scheduling. Scheduling
183
220
.
Tatiana Balbi Fraga. (2015) Three hybridization models based on local search scheme for job shop scheduling problem. IOP Conference Series: Materials Science and Engineering 83, pages 012001.
Crossref
Crossref
Sebastian Knopp, Stephane Dauzere-Peres & Claude Yugma. (2014) Flexible job-shop scheduling with extended route flexibility for semiconductor manufacturing. Flexible job-shop scheduling with extended route flexibility for semiconductor manufacturing.
Anis Gharbi, Mohamed Labidi & Mohamed Aly Louly. (2014) The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures. Journal of Applied Mathematics 2014, pages 1-14.
Crossref
Crossref
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
247
266
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
207
246
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
177
205
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
105
175
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
65
104
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
29
64
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
11
28
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
1
10
.
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
Crossref
Kerem Bülbül. (2011) A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. Computers & Operations Research 38:6, pages 967-983.
Crossref
Crossref
Geraldo R. Mateus, Martín G. Ravetti, Maurício C. de Souza & Taís M. Valeriano. (2009) Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration. Journal of Scheduling 13:3, pages 245-259.
Crossref
Crossref
Udo Buscher & Liji Shen. (2009) An integrated tabu search algorithm for the lot streaming problem in job shops. European Journal of Operational Research 199:2, pages 385-399.
Crossref
Crossref
Seyda Topaloglu & Gamze Kilincli. (2009) A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization. The International Journal of Advanced Manufacturing Technology 44:7-8, pages 781-794.
Crossref
Crossref
Pablo A. Marchetti & Jaime Cerdá. (2009) An approximate mathematical framework for resource-constrained multistage batch scheduling. Chemical Engineering Science 64:11, pages 2733-2748.
Crossref
Crossref
Kenneth R. Baker & Dan Trietsch. 2009. Principles of Sequencing and Scheduling. Principles of Sequencing and Scheduling
325
348
.
Hsueh-Chien Cheng, Tsung-Che Chiang & Li-Chen Fu. (2009) Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure. Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure.
S. M. Kamrul Hasan, Ruhul Sarker, Daryl Essam & David Cornforth. 2009. Natural Intelligence for Scheduling, Planning and Packing Problems. Natural Intelligence for Scheduling, Planning and Packing Problems
55
88
.
Seyda Topaloglu & Gamze Kilincli. 2009. Operations Research Proceedings 2008. Operations Research Proceedings 2008
159
164
.
S. M. Kamrul Hasan, Ruhul Sarker & David Cornforth. (2008) GA with priority rules for solving Job-Shop Scheduling Problems. GA with priority rules for solving Job-Shop Scheduling Problems.
Claude Yugma, Stephane Dauzere-Peres, Alexandre Derreumaux & Olivier Sibille. (2008) A Batch Optimization Sofware for diffusion area scheduling in semiconductor manufacturing. A Batch Optimization Sofware for diffusion area scheduling in semiconductor manufacturing.
Kuo-Ling Huang & Ching-Jong Liao. (2008) Ant colony optimization combined with taboo search for the job shop scheduling problem. Computers & Operations Research 35:4, pages 1030-1046.
Crossref
Crossref
M.H. Karimi Gav & M.H. Fazel Zara. (2008) A Heuristic Approach for Large Scale Job Shop Scheduling Problems. Journal of Applied Sciences 8:6, pages 992-999.
Crossref
Crossref
Michele E. Pfund, Hari Balasubramanian, John W. Fowler, Scott J. Mason & Oliver Rose. (2007) A multi-criteria approach for scheduling semiconductor wafer fabrication facilities. Journal of Scheduling 11:1, pages 29-47.
Crossref
Crossref
. 2008. Network Models and Optimization. Network Models and Optimization
297
417
.
Patrick Esquirol & Pierre Lopez. 2008. Production Scheduling. Production Scheduling
5
31
.
Saral Mukherjee & A.K. Chatterjee. (2007) On the representation of the one machine sequencing problem in the shifting bottleneck heuristic. European Journal of Operational Research 182:1, pages 475-479.
Crossref
Crossref
Gwo-Ji Sheen & Lu-Wen Liao. (2007) A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags. European Journal of Operational Research 181:1, pages 102-116.
Crossref
Crossref
. 2007. Handbook on Scheduling. Handbook on Scheduling
345
396
.
Chih-Sen Wu, Der-Chiang Li & Tung-I Tsai. (2006) Applying the fuzzy ranking method to the shifting bottleneck procedure to solve scheduling problems of uncertainty. The International Journal of Advanced Manufacturing Technology 31:1-2, pages 98-106.
Crossref
Crossref
. (2006) The Management of Innovation and Technology. Journal of Manufacturing Technology Management 17:3, pages 393-394.
Crossref
Crossref
Shiu Hong Choi & Feng Yu Yang. (2006) A filter search algorithm based on machine‐order space for job‐shop scheduling problems. Journal of Manufacturing Technology Management 17:3, pages 376-392.
Crossref
Crossref
Saral Mukherjee & A.K. Chatterjee. (2006) Applying machine based decomposition in 2-machine flow shops. European Journal of Operational Research 169:3, pages 723-741.
Crossref
Crossref
Shiu Hong Choi & Feng Yu Yang. (2005) Quick value‐setting algorithms for the longest path problem of job‐shop scheduling. Journal of Manufacturing Technology Management 16:8, pages 956-972.
Crossref
Crossref
Jeriad Zoghby, J. Wesley Barnes & John J. Hasenbein. (2005) Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches. European Journal of Operational Research 167:2, pages 336-348.
Crossref
Crossref
Alix Munier Kordon. (2004) Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. Operations Research Letters 32:6, pages 557-564.
Crossref
Crossref
S. H. Choi & F. Y. Yang. (2003) A machine‐order search space for job‐shop scheduling problems. International Transactions in Operational Research 10:6, pages 597-610.
Crossref
Crossref
Y. Le Quere, M. Sevaux, C. Tahon & D. Trentesaux. (2003) Reactive scheduling of complex system maintenance in a cooperative environment with communication times. IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) 33:2, pages 225-234.
Crossref
Crossref
Ulrich Domdorf, Erwin Pesch & Toän Phan Huy. 2003. Advances in Evolutionary Computing. Advances in Evolutionary Computing
773
798
.
Scott J. Mason, John W. Fowler & W. Matthew Carlyle. (2002) A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling 5:3, pages 247-262.
Crossref
Crossref
Nico J. Vandaele & Marc R. Lambrecht. 2002. Supply Chain Structures. Supply Chain Structures
207
255
.
Marcos Singer. (2001) Decomposition methods for large job shops. Computers & Operations Research 28:3, pages 193-207.
Crossref
Crossref
Jacek Błażewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt & Jan WęglarzJacek Błażewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt & Jan Węglarz. 2001. Scheduling Computer and Manufacturing Processes. Scheduling Computer and Manufacturing Processes
273
315
.
Ebru Demirkol & Reha Uzsoy. (2000) Decomposition methods for reentrant flow shops with sequence-dependent setup times. Journal of Scheduling 3:3, pages 155-177.
Crossref
Crossref
A.S. Jain & S. Meeran. (1999) Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research 113:2, pages 390-434.
Crossref
Crossref
Michael Pinedo & Marcos Singer. (1999) A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics (NRL) 46:1, pages 1-17.
Crossref
Crossref
Ulrich Dorndorf, Erwin Pesch & Toàn Phan Huy. 1999. Operations Research Proceedings 1998. Operations Research Proceedings 1998
353
365
.
Marc R. Lambrecht, Philip L. Ivens & Nico J. Vandaele. (1998) ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling. Management Science 44:11-part-1, pages 1548-1561.
Crossref
Crossref
Ebru Demirkol, Sanjay Mehta & Reha Uzsoy. (1998) Benchmarks for shop scheduling problems. European Journal of Operational Research 109:1, pages 137-141.
Crossref
Crossref
A. Gharbi, R. Pellerin & L. Villeneuve. (1998) Zone and resource scheduling in remanufacturing systems. Zone and resource scheduling in remanufacturing systems.
A. Gharbi, R. Pellerin & L. Villeneuve. (1998) Zone and resource scheduling in remanufacturing systems. Zone and resource scheduling in remanufacturing systems.
Su Ling-Huey, Chang Pei-Chann & E.S Lee. (1998) A heuristic for scheduling general job shops to minimize maximum lateness. Mathematical and Computer Modelling 27:1, pages 1-15.
Crossref
Crossref
Bo Chen, Chris N. Potts & Gerhard J. Woeginger. 1999. Handbook of Combinatorial Optimization. Handbook of Combinatorial Optimization
1493
1641
.
Irfan M. Ovacik & Reha UzsoyIrfan M. Ovacik & Reha Uzsoy. 1997. Decomposition Methods for Complex Factory Scheduling Problems. Decomposition Methods for Complex Factory Scheduling Problems
91
106
.
Irfan M. Ovacik & Reha UzsoyIrfan M. Ovacik & Reha Uzsoy. 1997. Decomposition Methods for Complex Factory Scheduling Problems. Decomposition Methods for Complex Factory Scheduling Problems
61
90
.
Irfan M. Ovacik & Reha UzsoyIrfan M. Ovacik & Reha Uzsoy. 1997. Decomposition Methods for Complex Factory Scheduling Problems. Decomposition Methods for Complex Factory Scheduling Problems
47
60
.
Irfan M. Ovacik & Reha UzsoyIrfan M. Ovacik & Reha Uzsoy. 1997. Decomposition Methods for Complex Factory Scheduling Problems. Decomposition Methods for Complex Factory Scheduling Problems
31
45
.
Irfan M. Ovacik & Reha UzsoyIrfan M. Ovacik & Reha Uzsoy. 1997. Decomposition Methods for Complex Factory Scheduling Problems. Decomposition Methods for Complex Factory Scheduling Problems
15
29
.
M.-C. Portmann. 1996. The Planning and Scheduling of Production Systems. The Planning and Scheduling of Production Systems
271
300
.
Lucian Finta & Zhen Liu. (1996) Single machine scheduling subject to precedence delays. Discrete Applied Mathematics 70:3, pages 247-266.
Crossref
Crossref
Jacek Błażewicz, Wolfgang Domschke & Erwin Pesch. (1996) The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research 93:1, pages 1-33.
Crossref
Crossref
Philip Ivens & Marc Lambrecht. (1996) Extending the shifting bottleneck procedure to real-life applications. European Journal of Operational Research 90:2, pages 252-268.
Crossref
Crossref
Jacek Błażewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt & Jan WęglarzJacek Błażewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt & Jan Węglarz. 1996. Scheduling Computer and Manufacturing Processes. Scheduling Computer and Manufacturing Processes
275
317
.
Oscar Ciro Lopez, Ricardo M. Barcia & Osama Eyada. (1995) Problema de programação da produção um esquema de classificação. Production 5:2, pages 145-168.
Crossref
Crossref
Stéphane Dauzère-Pérès. (1995) A procedure for the one-machine sequencing problem with dependent jobs. European Journal of Operational Research 81:3, pages 579-589.
Crossref
Crossref
Ulrich Dorndorf & Erwin Pesch. (1995) Evolution based learning in a job shop scheduling environment. Computers & Operations Research 22:1, pages 25-40.
Crossref
Crossref
Stephane Dauzère-Péres & Jean-Bernard Lasserre. (1994) Integration of lotsizing and scheduling decisions in a job-shop. European Journal of Operational Research 75:2, pages 413-426.
Crossref
Crossref
Stephane Dauzere-Peres. (1993) The one-machine sequencing problem with dependent jobs. Computers & Industrial Engineering 25:1-4, pages 235-238.
Crossref
Crossref