Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Bautista, Alberto Cano (2011)
Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rulesEur. J. Oper. Res., 210
Muhammad Nawaz, E. Enscore, I. Ham (1983)
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega-international Journal of Management Science, 11
A. Ozolins (2019)
Improved bounded dynamic programming algorithm for solving the blocking flow shop problemCentral European Journal of Operations Research, 27
Kuo-Ching Ying, C. Liao (2004)
An ant colony system for permutation flow-shop sequencingComput. Oper. Res., 31
W. Yu, H. Hoogeveen, J. Lenstra (2004)
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-HardJournal of Scheduling, 7
C. Reeves (1995)
A genetic algorithm for flowshop sequencingComput. Oper. Res., 22
J. Bautista, Alberto Cano, R. Companys, Imma Ribas (2012)
Solving the Fm∣block∣Cmax problem using Bounded Dynamic ProgrammingEng. Appl. Artif. Intell., 25
E. Viles, M. Ormazábal, Á. Lleó (2017)
Closing the Gap Between Practice and Research in Industrial Engineering
J. Hoogeveen, J. Lenstra, B. Veltman (1996)
PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARDEuropean Journal of Operational Research, 89
I. Osman, C. Potts (1989)
Simulated annealing for permutation flow-shop schedulingOmega-international Journal of Management Science, 17
Victor Fernandez-Viagas, Rubén Ruiz, J. Framiñan (2017)
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluationEur. J. Oper. Res., 257
J Bautista, R Alfaro-Pozo, C Batalla-García (2018)
Closing the gap between practice and research in industrial engineering. Lecture notes in management and industrial engineering
Q. Pan, Ling Wang (2012)
Effective heuristics for the blocking flowshop scheduling problem with makespan minimizationOmega-international Journal of Management Science, 40
R. Logendran, C. Sriskandarajah (1993)
Two-machine group scheduling problem with blocking and anticipatory setupsEuropean Journal of Operational Research, 69
R. Graham, E. Lawler, J. Lenstra, A. Kan (1977)
Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyAnnals of discrete mathematics, 5
Vince Caraffa, Stefano Ianes, T. Bagchi, C. Sriskandarajah (2001)
Minimizing makespan in a blocking flowshop using genetic algorithmsInternational Journal of Production Economics, 70
M. Tasgetiren, Damla Kizilay, Q. Pan, P. Suganthan (2017)
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterionComput. Oper. Res., 77
Nouri Nouha, T. Ladhari (2018)
Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blockingAnnals of Operations Research, 267
R. Aggoune (2001)
Minimizing the makespan for the flow shop scheduling problem with availability constraintsEur. J. Oper. Res., 153
Michael Pinedo (1994)
Scheduling: Theory, Algorithms, and Systems
Joaquín Bautista-Valhondo, Rocío Alfaro-Pozo (2018)
An expert system to minimize operational costs in mixed-model sequencing problems with activity factorExpert Systems with Applications
J. Valhondo, R. Pozo, Cristina García (2016)
Minimizing lost-work costs in a mixed-model assembly line
J Bautista-Valhondo, R Alfaro-Pozo (2018)
An expert system to minimize operational costs in mixed-model sequencing problems with activity factorExpert Syst Appl, 104
Nicholas Hall, C. Sriskandarajah (1996)
A Survey of Machine Scheduling Problems with Blocking and No-Wait in ProcessOper. Res., 44
Yu-yan Han, Q. Pan, Jun-qing Li, Hongyan Sang (2012)
An improved artificial bee colony algorithm for the blocking flowshop scheduling problemThe International Journal of Advanced Manufacturing Technology, 60
É. Taillard (1990)
Some efficient heuristic methods for the flow shop sequencing problemEuropean Journal of Operational Research, 47
Shih-Wei Lin, Kuo-Ching Ying (2013)
Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithmOmega-international Journal of Management Science, 41
(1997)
Scheduling " ,
Imma Ribas, R. Companys, X. Tort-Martorell (2011)
An iterated greedy algorithm for the flowshop scheduling problem with blockingOmega-international Journal of Management Science, 39
É. Taillard (1993)
Benchmarks for basic scheduling problemsEuropean Journal of Operational Research, 64
J. Grabowski, J. Pempera (2007)
The permutation flow shop problem with blocking. A tabu search approachOmega-international Journal of Management Science, 35
D. Ronconi (2005)
A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with BlockingAnnals of Operations Research, 138
D. Ronconi (2004)
A note on constructive heuristics for the flowshop problem with blockingInternational Journal of Production Economics, 87
This paper presents two mixed integer linear programming (MILP) models that extend two basic Flow Shop Scheduling problems: Fm\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{Fm}} $$\end{document}/prmu\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{prmu}} $$\end{document}/Cmax\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{C}}_{ \hbox{max} } $$\end{document} and Fm\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{Fm}} $$\end{document}/block\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{block}} $$\end{document}/Cmax\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{C}}_{ \hbox{max} } $$\end{document}. This extension incorporates the concept of an overall demand plan for types of jobs or products. After using an example to illustrate the new problems under study, we evaluated the new models and analyzed their behaviors when applied to instances found in the literature and industrial instances of a case study from Nissan’s plant in Barcelona. CPLEX solver was used as a solution tool and obtained acceptable results, allowing us to conclude that MILP can be used as a method for solving Flow Shop Scheduling problems with an overall demand plan.
Central European Journal of Operations Research – Springer Journals
Published: Mar 29, 2020
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.