Mathematical programming formulations for machine scheduling: A survey
From MaRDI portal
(Redirected from Publication:811337)
Recommendations
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- scientific article; zbMATH DE number 3873052 (Why is no real title available?)
- scientific article; zbMATH DE number 4143763 (Why is no real title available?)
- scientific article; zbMATH DE number 3943560 (Why is no real title available?)
- scientific article; zbMATH DE number 3989090 (Why is no real title available?)
- scientific article; zbMATH DE number 4095196 (Why is no real title available?)
- scientific article; zbMATH DE number 3691044 (Why is no real title available?)
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 3757695 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- scientific article; zbMATH DE number 3633982 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3431960 (Why is no real title available?)
- A dual algorithm for the one-machine scheduling problem
- A new polynomial-time algorithm for linear programming
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- Batching to Minimize Flow Times on One Machine
- Bounds on Multiprocessing Timing Anomalies
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Geometric algorithms and combinatorial optimization
- Integer Programming Formulation of Traveling Salesman Problems
- Job-Shop Scheduling by Implicit Enumeration
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Minimizing Mean Flow Time With Release Time and Deadline Constraints
- Minimizing Total Tardiness on One Machine is NP-Hard
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- On general routing problems
- On the two-phase method for preemptive scheduling
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Preemptive Scheduling, Linear Programming and Network Flows
- Preemptive scheduling with staircase and piecewise linear resource availability
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- Scheduling independent tasks to reduce mean finishing time
- Scheduling subject to resource constraints: Classification and complexity
- Some simple scheduling algorithms
- Surrogate duality relaxation for job shop scheduling
- The Periodic Loading Problem: Formulation And Heuristics
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Time-Optimal Control of Resource Allocation in a Complex of Operations Framework
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
Cited in
(36)- Genetic algorithms and simulated annealing for scheduling in agile manufacturing
- 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
- Fast LP models and algorithms for identical jobs on uniform parallel machines
- Project scheduling under the threat of catastrophic disruption
- 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
- Modeling the parallel machine scheduling problem with step deteriorating jobs
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- 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
- Evaluation of mathematical models for flexible job-shop scheduling problems
- A systematic review of multi-objective hybrid flow shop scheduling
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Optimizing the physician scheduling problem in a large hospital ward
- Towards a robust scheduling on unrelated parallel machines: a scenarios based approach
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- Deterministic job-shop scheduling: Past, present and future
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- Simplifying dispatching rules in genetic programming for dynamic job shop scheduling
- Scheduling manufacturing systems for delayed product differentiation in agile manufacturing
- Evolution based learning in a job shop scheduling environment
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)
