Flowshop scheduling problem with parallel semi-lines and final synchronization operation

DOI10.1016/j.cor.2019.04.011zbMath1458.90300OpenAlexW2936713194WikidataQ128062647 ScholiaQ128062647MaRDI QIDQ2003426

Yassine Ouazene, Mauricio C. de Souza, Irce F. G. Guimarães, Farouk Yalaoui

Publication date: 8 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.04.011

zbMATH Keywords

simulated annealing algorithmGRASP algorithmflowshop schedulingheuristic and metaheuristic methodssynchronization operation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning

Cites Work

• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
• The distributed permutation flowshop scheduling problem
• A new heuristic method for the flow shop sequencing problem
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• New heuristics for total tardiness minimization in a flexible flowshop
• Benchmarks for basic scheduling problems
• Scheduling two-stage hybrid flow shop with availability constraints
• Flowshop scheduling research after five decades
• Two MILP models for the N × M SDST flowshop sequencing problem
• Optimal two- and three-stage production schedules with setup times included
• Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
• MIP Formulations for Flowshop Scheduling with Limited Buffers
• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• The Complexity of Flowshop and Jobshop Scheduling
• A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

This page was built for publication: Flowshop scheduling problem with parallel semi-lines and final synchronization operation