A study of integer programming formulations for scheduling problems
From MaRDI portal
Publication:3124684
DOI10.1080/00207729708929360zbMath0873.90054OpenAlexW2065053103MaRDI QIDQ3124684
Publication date: 13 March 1997
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207729708929360
Related Items
New effective MILP models for PFSPs arising from real applications ⋮ Hybrid flexible flowshop problems: models and solution methods ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ Evaluation of mathematical models for flexible job-shop scheduling problems ⋮ A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness ⋮ Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters ⋮ On some lower bounds for the permutation flowshop problem ⋮ Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness ⋮ GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs ⋮ A study on open shop scheduling to minimise total tardiness ⋮ An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems ⋮ Approaches to modeling train scheduling problems as job-shop problems with blocking constraints ⋮ Mixed binary integer programming formulations for the reentrant job shop scheduling problem ⋮ Mathematical models for job-shop scheduling problems with routing and process plan flexibility ⋮ Optimal scheduling for flexible job shop operation ⋮ The distributed permutation flowshop scheduling problem ⋮ Polynomial time approximation algorithms for proportionate open‐shop scheduling ⋮ Model formulations for the machine scheduling problem with limited waiting time constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Mathematical programming formulations for machine scheduling: A survey
- A state-of-the-art review of parallel-machine scheduling research
- Survey of scheduling research involving due date determination decisions
- Flow-shop scheduling with flexible processors
- Solving Large-Scale Zero-One Linear Programming Problems
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- A Review of Production Scheduling
- An Improved Formulation for the Job-Shop Scheduling Problem
- A Computational Study of the Job-Shop Scheduling Problem
- A Survey of Scheduling Rules
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop
- An experimental comparison of solution algorithms for the single-machine tardiness problem
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- The Schedule-Sequencing Problem
- Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques
