Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling

DOI10.1016/J.AMC.2006.06.092MaRDI QIDQ870153zbMATHOpenAlexFDO

Authors Mohsen Ziaee, Seyed Jafar Sadjadi

Publication date 12 March 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.06.092

zbMATH Keywords

schedulingflow shop scheduling problemmixed binary integer programmingprojects scheduling

Mathematics Subject Classification ID

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

Recommendations

• A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
• A study of integer programming formulations for scheduling problems
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem

Cites work

• A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• Comparative evaluation of MILP flowshop models
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Flowshop scheduling research after five decades
• Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem
• Nonpreemptive flowshop scheduling with machine dominance
• On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
• The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
• Two MILP models for the N × M SDST flowshop sequencing problem
• Two models for a family of flowshop sequencing problems
• Two-machine flow shop scheduling problems with no-wait jobs
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
• Two-machine flowshop scheduling with job class setups to minimize total flowtime

Cited in

(4)

• On the exact solution of the no-wait flow shop problem with due date constraints
• A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem
• Job-shop production scheduling with reverse flows

This page was built for publication: Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling

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