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

DOI10.1016/j.amc.2006.06.092zbMath1121.90069OpenAlexW1994775122MaRDI QIDQ870153

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

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

Related Items (2)

Job-shop production scheduling with reverse flows ⋮ On the exact solution of the no-wait flow shop problem with due date constraints

Cites Work

• Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Nonpreemptive flowshop scheduling with machine dominance
• 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
• Two-machine flow shop scheduling problems with no-wait jobs
• Two-machine flowshop scheduling with job class setups to minimize total flowtime
• Two models for a family of flowshop sequencing problems
• The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
• 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
• Flowshop scheduling research after five decades
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Two MILP models for the N × M SDST flowshop sequencing problem
• On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem
• Comparative evaluation of MILP flowshop models
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues

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