New MILP models for the permutation flowshop problem

DOI10.1057/PALGRAVE.JORS.2602455MaRDI QIDQ3612203zbMATH OpenOpenAlexFDO

Authors F. T. Tseng, Edward F. jun. Stafford

Publication date 3 March 2009

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2602455

zbMATH Keywords

computational analysisinteger programmingschedulingsequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Comparative evaluation of MILP flowshop models
• Two MILP models for the N × M SDST flowshop sequencing problem
• New effective MILP models for PFSPs arising from real applications
• A new integer programming formulation for the permutation flowshop problem
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem

Cited in

(23)

• The distributed permutation flowshop scheduling problem
• A new integer programming formulation for the permutation flowshop problem
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
• Energy-efficient bi-objective single-machine scheduling with power-down mechanism
• Two models for a family of flowshop sequencing problems
• Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut
• Solving permutation flow shop scheduling problem with sequence-independent setup time
• Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
• Improved MILP models for two-machine flowshop with batch processing machines
• A MILP model for an extended version of the flexible job shop problem
• Two MILP models for the N × M SDST flowshop sequencing problem
• A study on open shop scheduling to minimise total tardiness
• New effective MILP models for PFSPs arising from real applications
• MILP models for the optimization of real production lines
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• scientific article; zbMATH DE number 4089300 (Why is no real title available?)
• On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem
• Comparative evaluation of MILP flowshop models
• Polynomial time approximation algorithms for proportionate open-shop scheduling
• Detecting and exploiting permutation structures in MIPs
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
• Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty

This page was built for publication: New MILP models for the permutation flowshop problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612203)