110
Views
17
CrossRef citations to date
0
Altmetric
Original Articles

Bicriteria scheduling in a two-machine permutation flowshop

&
Pages 2299-2312 | Received 01 Oct 2005, Published online: 22 Feb 2007

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

Read on this site (4)

Frederik Ferid Ostermeier. (2022) On the trade-offs between scheduling objectives for unpaced mixed-model assembly lines. International Journal of Production Research 60:3, pages 866-893.
Read now
Javad Navaei & Hoda ElMaraghy. (2017) Grouping and sequencing product variants based on setup similarity. International Journal of Computer Integrated Manufacturing 30:6, pages 664-676.
Read now
Mingbao Cheng, Pandu R Tadikamalla, Jennifer Shang & Bixi Zhang. (2015) Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time. Journal of the Operational Research Society 66:5, pages 709-719.
Read now
T.C.E. Cheng, B.M.T. Lin & Y. Tian. (2013) A scheduling model for the refurbishing process in recycling management. International Journal of Production Research 51:23-24, pages 7120-7139.
Read now

Articles from other publishers (13)

Xiaojuan Jiang, Kangbok Lee & Michael L. Pinedo. (2023) Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits. Journal of Scheduling.
Crossref
Hafed M. Motair. (2021) Exact and Hybrid Metaheuristic Algorithms to Solve Bi-Objective Permutation Flow Shop Scheduling Problem. Journal of Physics: Conference Series 1818:1, pages 012042.
Crossref
Martin Gutjahr, Hans Kellerer & Sophie N. Parragh. (2021) Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system. Procedia Computer Science 180, pages 825-832.
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
Yaping Fu, Hongfeng Wang, Min Huang & Junwei Wang. (2017) A decomposition based multiobjective genetic algorithm with adaptive multipopulation strategy for flowshop scheduling problem. Natural Computing 18:4, pages 757-768.
Crossref
R Sanjeev Kumar, KP Padmanaban & M Rajkumar. (2016) Minimizing makespan and total flow time in permutation flow shop scheduling problems using modified gravitational emulation local search algorithm. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 232:3, pages 534-545.
Crossref
Hongfeng Wang, Yaping Fu, Min Huang, George Q. Huang & Junwei Wang. (2017) A NSGA-II based memetic algorithm for multiobjective parallel flowshop scheduling problem. Computers & Industrial Engineering 113, pages 185-194.
Crossref
Ana Amélia S. Pereira, Helio J. C. Barbosa & Heder S. Bernardino. 2017. Evolutionary Multi-Criterion Optimization. Evolutionary Multi-Criterion Optimization 484 498 .
Mehmet Mutlu Yenisey & Betul Yagmahan. (2014) Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends. Omega 45, pages 119-135.
Crossref
Yi Sun, Chaoyong Zhang, Liang Gao & Xiaojuan Wang. (2010) Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects. The International Journal of Advanced Manufacturing Technology 55:5-8, pages 723-739.
Crossref
K.L. Choy, Y.K. Leung, H.K.H. Chow, T.C. Poon, C.K. Kwong, G.T.S. Ho & S.K. Kwok. (2011) A hybrid scheduling decision support model for minimizing job tardiness in a make-to-order based mould manufacturing environment. Expert Systems with Applications 38:3, pages 1931-1941.
Crossref
Feng-Cheng Lin, Chien-Yin Lai & Jen-Shin Hong. (2008) Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries. Data & Knowledge Engineering 66:3, pages 382-401.
Crossref
Gerardo Minella, Rubén Ruiz & Michele Ciavotta. (2008) A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem. INFORMS Journal on Computing 20:3, pages 451-471.
Crossref

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:

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:

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.