16
Views
28
CrossRef citations to date
0
Altmetric
Technical Note

Bicriterion scheduling in the two-machine flowshop

, &
Pages 929-935 | Received 01 Aug 1994, Accepted 01 Mar 1997, Published online: 20 Dec 2017

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

Read on this site (1)

J E C Arroyo & V A Armentano. (2004) A partial enumeration heuristic for multi-objective flowshop scheduling problems. Journal of the Operational Research Society 55:9, pages 1000-1007.
Read now

Articles from other publishers (27)

Meysam Kazemi Esfeh, Amir Abbas Shojaie, Hasan Javanshir & Kaveh Khalili-Damghani. (2022) Flexible Flow Shop Scheduling Problem with Reliable Transporters and Intermediate Limited Buffers via considering Learning Effects and Budget Constraint. Complexity 2022, pages 1-19.
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
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
Fuqing Zhao, Jianxin Tang, Junbiao Wang & Jonrinaldi. (2014) An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem. Computers & Operations Research 45, pages 38-50.
Crossref
Mark T. Leung. 2013. Advances in Business and Management Forecasting. Advances in Business and Management Forecasting 197 225 .
Hamilton Emmons & George VairaktarakisHamilton Emmons & George Vairaktarakis. 2013. Flow Shop Scheduling. Flow Shop Scheduling 21 66 .
José Elias Claudio Arroyo & Ana Amélia de Souza Pereira. (2010) A GRASP heuristic for the multi-objective permutation flowshop scheduling problem. The International Journal of Advanced Manufacturing Technology 55:5-8, pages 741-753.
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
Ethel Mokotoff. 2011. Enterprise Information Systems Design, Implementation and Management. Enterprise Information Systems Design, Implementation and Management 211 233 .
Ethel Mokotoff. (2011) Algorithms for bicriteria minimization in the permutation flow shop scheduling problem. Journal of Industrial & Management Optimization 7:1, pages 253-282.
Crossref
Deming Lei. (2008) Multi-objective production scheduling: a survey. The International Journal of Advanced Manufacturing Technology 43:9-10, pages 926-938.
Crossref
E. Mokotoff. 2009. Computational Intelligence in Flow Shop and Job Shop Scheduling. Computational Intelligence in Flow Shop and Job Shop Scheduling 101 150 .
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
Bin-Bin Li, Ling Wang & Bo Liu. (2008) An Effective PSO-Based Hybrid Algorithm for Multiobjective Permutation Flow Shop Scheduling. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 38:4, pages 818-831.
Crossref
Tamer Eren & Ertan Güner. (2007) The tricriteria flowshop scheduling problem. The International Journal of Advanced Manufacturing Technology 36:11-12, pages 1210-1220.
Crossref
Ling Wang & Bin-bin Li. 2008. Quantum Inspired Intelligent Systems. Quantum Inspired Intelligent Systems 17 56 .
George Steiner & Paul Stephenson. (2007) Pareto optima for total weighted completion time and maximum lateness on a single machine. Discrete Applied Mathematics 155:17, pages 2341-2354.
Crossref
Amol Singh, N. K. Mehta & P. K. Jain. (2006) Multicriteria dynamic scheduling by swapping of dispatching rules. The International Journal of Advanced Manufacturing Technology 34:9-10, pages 988-1007.
Crossref
Vincent T’kindt, Karima Bouibede-Hocine & Carl Esswein. (2007) Counting and enumeration complexity with application to multicriteria scheduling. Annals of Operations Research 153:1, pages 215-234.
Crossref
Bin-Bin Li & Ling Wang. (2007) A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 37:3, pages 576-591.
Crossref
Vincent T’kindt, Federico Della Croce & Jean-Louis Bouquard. (2007) Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria. INFORMS Journal on Computing 19:1, pages 64-72.
Crossref
Walter Habenicht & Martin Josef Geiger. 2006. Perspectives on Operations Research. Perspectives on Operations Research 47 67 .
José Elias Claudio Arroyo & Vinícius Amaral Armentano. (2005) Genetic local search for multi-objective flowshop scheduling problems. European Journal of Operational Research 167:3, pages 717-738.
Crossref
Han Hoogeveen. (2005) Multicriteria scheduling. European Journal of Operational Research 167:3, pages 592-623.
Crossref
T. Loukil, J. Teghem & D. Tuyttens. (2005) Solving multi-objective production scheduling problems using metaheuristics. European Journal of Operational Research 161:1, pages 42-61.
Crossref
V. T'kindt & J.-C. Billaut. (2002) Multicriteria scheduling problems: a survey. RAIRO - Operations Research 35:2, pages 143-163.
Crossref
V. T'kindt & J.-C. Billaut. (1999) Some guidelines to solve multicriteria scheduling problems. Some guidelines to solve multicriteria scheduling problems.

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.