Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem

DOI10.1016/j.cor.2019.06.012zbMath1458.90310OpenAlexW2955323683WikidataQ127596274 ScholiaQ127596274MaRDI QIDQ2273694

Yanyan Li

Publication date: 25 September 2019

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

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

zbMATH Keywords

heuristicsmakespan minimizationiterated local searchordered flow shop schedulingpyramidal-shaped propertyV-shaped property

Mathematics Subject Classification ID

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

Related Items

Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs

Uses Software

• Matlab
• CPLEX
• NILS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hard benchmark for flowshop scheduling problems minimising makespan
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• Two-machine flow shop scheduling problem with an outsourcing option
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• An improved NEH-based heuristic for the permutation flowshop problem
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
• Optimal streaming of a single job in a two-stage flow shop
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• A comprehensive review and evaluation of permutation flowshop heuristics
• A computational study of the permutation flow shop problem based on a tight lower bound
• Fast heuristics for minimizing the makespan in non-permutation flow shops
• The three-machine proportionate flow shop problem with unequal machine speeds
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• Online scheduling of ordered flow shops
• Outsourcing and scheduling for two-machine ordered flow shop scheduling problems
• On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• Benchmarks for basic scheduling problems
• An improved NEH heuristic to minimize makespan in permutation flow shops
• Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
• Review of the ordered and proportionate flow shop scheduling research
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case
• Ordered Flow Shop Problems with no In-Process Waiting: Further Results
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Flowshop sequencing problem with ordered processing time matrices: A general case
• A convex property of an ordered flow shop sequencing problem
• Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures
• An Ordered Flow Shop with Two Agents
• Tabu search for a class of single-machine scheduling problems

This page was built for publication: Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem