Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness

DOI10.1007/978-1-4614-1123-9_5zbMath1355.90028OpenAlexW2169334805MaRDI QIDQ2958669

Ernesto G. Birgin, Débora P. Ronconi

Publication date: 3 February 2017

Published in: Just-in-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-1123-9_5

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

MILP models for the optimization of real production lines ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach ⋮ Method of rescheduling for hybrid production lines with intermediate buffers ⋮ Flowshop scheduling problem with parallel semi-lines and final synchronization operation ⋮ Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs

Uses Software

• AMPL

Cites Work

• Unnamed Item
• Minimizing total tardiness in permutation flowshops
• A decomposition algorithm for the single machine total tardiness problem
• Benchmarks for basic scheduling problems
• A study of integer programming formulations for scheduling problems
• Flowshop sequencing problems with limited buffer storage
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• The Lessons of Flowshop Scheduling Research
• An Improved Formulation for the Job-Shop Scheduling Problem
• Comparative evaluation of MILP flowshop models
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

This page was built for publication: Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness