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