On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
From MaRDI portal
Publication:3815121
DOI10.1057/jors.1988.193zbMath0663.90046OpenAlexW2026694496MaRDI QIDQ3815121
Publication date: 1988
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1988.193
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)
Related Items (26)
An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ New effective MILP models for PFSPs arising from real applications ⋮ Flow-shop scheduling with flexible processors ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ Exact solutions for the two-machine robust flow shop with budgeted uncertainty ⋮ Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness ⋮ Job lateness in a two-machine flowshop with setup times separated ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ Flowshop scheduling problem with parallel semi-lines and final synchronization operation ⋮ Mathematical models for preemptive shop scheduling problems ⋮ Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem ⋮ Effective heuristics for the single machine sequencing problem with ready times ⋮ A matheuristic approach for the two-machine total completion time flow shop problem ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ A global MILP model for FMS scheduling ⋮ Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning ⋮ The distributed permutation flowshop scheduling problem ⋮ Polynomial time approximation algorithms for proportionate open‐shop scheduling ⋮ A study of integer programming formulations for scheduling problems ⋮ Two models for a family of flowshop sequencing problems
Uses Software
This page was built for publication: On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
