Mixed integer linear programming models for flow shop scheduling with a demand plan of job types

DOI10.1007/s10100-018-0553-8OpenAlexW2806735062WikidataQ129801663 ScholiaQ129801663MaRDI QIDQ2303310

Rocío Alfaro-Pozo, Joaquín Bautista-Valhondo

Publication date: 3 March 2020

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/119234

zbMATH Keywords

mixed integer linear programmingflow shop scheduling problemmixed model assembly linesmixed model sequencing problemoverall demand plan

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (3)

Or in the industrial engineering of industry 4.0: experiences from the Iberian Peninsula mirrored in CJOR ⋮ Special issue: engineering digital transformation ⋮ Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning

Uses Software

• CPLEX

Cites Work

• Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• Some efficient heuristic methods for the flow shop sequencing problem
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Two-machine group scheduling problem with blocking and anticipatory setups
• A genetic algorithm for flowshop sequencing
• Minimizing the makespan for the flow shop scheduling problem with availability constraints.
• An ant colony system for permutation flow-shop sequencing
• Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• Benchmarks for basic scheduling problems
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Scheduling

This page was built for publication: Mixed integer linear programming models for flow shop scheduling with a demand plan of job types