Advanced search
Publication Cover
Journal of the Operational Research Society Volume 49, 1998 - Issue 1
Submit an article Journal homepage
31
Views
18
CrossRef citations to date
0
Altmetric
Theoretical Paper

Minimising makespan in the two-machine flow-shop with release times

R TadeiD.A.I., Politecnico di TorinoItalyCorrespondence[email protected]
,
J N D GuptaBall State UniversityUSA
,
F Della CroceD.A.I., Politecnico di TorinoItaly
&
M CortesiD.A.I., Politecnico di TorinoItaly
Pages 77-85 | Received 01 Jul 1996, Accepted 01 Jul 1997, Published online: 20 Dec 2017

Citations (18)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (5)

Tao Ren, Xinyue Wang, Tianyi Liu, Chin-Chia Wu, Danyu Bai, Lin Lin & Meiting Guo. (2022) Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates. Engineering Optimization 54:11, pages 1853-1869.
Read now
Fardin Ahmadizar & Zeinab Amiri. (2018) Outsourcing and scheduling for a two-machine flow shop with release times. Engineering Optimization 50:3, pages 483-498.
Read now
Mohammad Mahdavi Mazdeh & Mohammad Rostami. (2014) A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs. International Journal of Systems Science: Operations & Logistics 1:2, pages 94-104.
Read now
Christian A. Ullrich. (2012) Supply chain scheduling: makespan reduction potential. International Journal of Logistics Research and Applications 15:5, pages 323-336.
Read now
S-W Choi & Y-D Kim. (2007) Minimizing makespan on a two-machine re-entrant flowshop. Journal of the Operational Research Society 58:7, pages 972-981.
Read now

Articles from other publishers (13)

Yan Qiao, NaiQi Wu, YunFang He, ZhiWu Li & Tao Chen. (2022) Adaptive genetic algorithm for two-stage hybrid flow-shop scheduling with sequence-independent setup time and no-interruption requirement. Expert Systems with Applications 208, pages 118068.
Crossref
Xin Chen, Sergey Kovalev, Małgorzata Sterna & Jacek Błażewicz. (2020) Mirror scheduling problems with early work and late work criteria. Journal of Scheduling 24:5, pages 483-487.
Crossref
Caio Paziani Tomazella & Marcelo Seido Nagano. (2020) A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem. Expert Systems with Applications 158, pages 113556.
Crossref
Joanna Berlińska. 2020. Parallel Processing and Applied Mathematics. Parallel Processing and Applied Mathematics 230 241 .
Peihai Liu & Xiwen Lu. (2014) A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan. Computers & Operations Research 51, pages 251-256.
Crossref
Hamilton Emmons & George VairaktarakisHamilton Emmons & George Vairaktarakis. 2013. Flow Shop Scheduling. Flow Shop Scheduling 21 66 .
Pawel J. Kalczynski & Jerzy Kamburowski. (2012) An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times. Computers & Operations Research 39:11, pages 2659-2665.
Crossref
Talel Ladhari & Mohamed Ali Rakrouki. (2009) Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop. International Journal of Production Economics 122:2, pages 678-691.
Crossref
Mohamed Anis Allouche, Belaïd Aouni, Jean-Marc Martel, Taïcir Loukil & Abdelwaheb Rebaï. (2009) Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions. European Journal of Operational Research 192:2, pages 460-467.
Crossref
Jinliang Cheng, Hiroshi Kise, George Steiner & Paul Stephenson. 2003. Fuzzy Sets Based Heuristics for Optimization. Fuzzy Sets Based Heuristics for Optimization 21 35 .
Jinliang Cheng, George Steiner & Paul Stephenson. (2002) Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. Journal of Scheduling 5:1, pages 71-92.
Crossref
Jinliang Cheng, George Steiner & Paul Stephenson. (2001) A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. European Journal of Operational Research 130:3, pages 559-575.
Crossref
Bo Chen, Chris N. Potts & Gerhard J. Woeginger. 1999. Handbook of Combinatorial Optimization. Handbook of Combinatorial Optimization 1493 1641 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.