Mathematical programming formulations for machine scheduling: A survey
From MaRDI portal
Publication:811337
DOI10.1016/0377-2217(91)90304-EzbMATH Open0734.90040WikidataQ57387911 ScholiaQ57387911MaRDI QIDQ811337FDOQ811337
Authors: Moshe Dror, Jacek Blazewicz, Jan Węglarz 
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- A new polynomial-time algorithm for linear programming
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Integer Programming Formulation of Traveling Salesman Problems
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Title not available (Why is that?)
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Bounds on Multiprocessing Timing Anomalies
- Scheduling subject to resource constraints: Classification and complexity
- Minimizing Total Tardiness on One Machine is NP-Hard
- Title not available (Why is that?)
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Scheduling independent tasks to reduce mean finishing time
- Batching to Minimize Flow Times on One Machine
- The Periodic Loading Problem: Formulation And Heuristics
- Title not available (Why is that?)
- On general routing problems
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Some simple scheduling algorithms
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Surrogate duality relaxation for job shop scheduling
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- Title not available (Why is that?)
- Title not available (Why is that?)
- Time-Optimal Control of Resource Allocation in a Complex of Operations Framework
- Title not available (Why is that?)
- A dual algorithm for the one-machine scheduling problem
- Job-Shop Scheduling by Implicit Enumeration
- Title not available (Why is that?)
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- On the two-phase method for preemptive scheduling
- Title not available (Why is that?)
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Preemptive Scheduling, Linear Programming and Network Flows
- Title not available (Why is that?)
- Title not available (Why is that?)
- Preemptive scheduling with staircase and piecewise linear resource availability
- Minimizing Mean Flow Time With Release Time and Deadline Constraints
- Title not available (Why is that?)
Cited In (36)
- A study of integer programming formulations for scheduling problems
- An application of dynamic programming to assign pressing tanks at wineries
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- Minimizing the makespan on two identical parallel machines with mold constraints
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem
- MP or not MP: that is the question
- Terminal inventory level constraints for online production scheduling
- Scheduling identical jobs on uniform parallel machines under position-based learning effects
- Project scheduling under the threat of catastrophic disruption
- Fast LP models and algorithms for identical jobs on uniform parallel machines
- A machine-order search space for job-shop scheduling problems
- Complementary column generation and bounding approaches for set partitioning formulations
- Job-shop production scheduling with reverse flows
- Optimal solutions for a dock assignment problem with trailer transportation
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- Modeling the parallel machine scheduling problem with step deteriorating jobs
- Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
- Mathematical model applied to single-track line scheduling problem in Brazilian railways
- The job shop scheduling problem: Conventional and new solution techniques
- 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
- A systematic review of multi-objective hybrid flow shop scheduling
- Evaluation of mathematical models for flexible job-shop scheduling problems
- Towards a robust scheduling on unrelated parallel machines: a scenarios based approach
- Optimizing the physician scheduling problem in a large hospital ward
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Deterministic job-shop scheduling: Past, present and future
- Simplifying dispatching rules in genetic programming for dynamic job shop scheduling
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- Scheduling manufacturing systems for delayed product differentiation in agile manufacturing
- Evolution based learning in a job shop scheduling environment
- Genetic algorithms and simulated annealing for scheduling in agile manufacturing
This page was built for publication: Mathematical programming formulations for machine scheduling: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811337)
