Exact and approximate algorithms for high-multiplicity parallel machine scheduling
From MaRDI portal
Recommendations
- Parallel machine scheduling with high multiplicity
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- High-multiplicity cyclic job shop scheduling
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
Cites work
- A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flowtimes of Jobs with Exponential Processing Times
- A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
- A framework for the complexity of high-multiplicity scheduling problems
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- A polynomial algorithm for multiprocessor scheduling with two job lengths.
- Convex separable optimization is not much harder than linear optimization
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Multiplicity and complexity issues in contemporary production scheduling
- On polynomial solvability of the high multiplicity total weighted tardiness problem
- On Scheduling Independent Tasks with Restricted Execution Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with high multiplicity
- Parallel machine scheduling with splitting jobs
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- The linear balancing flow problem
Cited in
(19)- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
- Cyclic lot-sizing problems with sequencing costs
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times
- A framework for the complexity of high-multiplicity scheduling problems
- An exact framework for the discrete parallel machine scheduling location problem
- Heuristic and exact algorithms for the identical parallel machine scheduling problem
- An alternative approach for proving the NP-hardness of optimization problems
- High-multiplicity scheduling on one machine with forbidden start and completion times
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- High Multiplicity in Earliness-Tardiness Scheduling
- Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
- Parallel machine scheduling with high multiplicity
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
- New support size bounds for integer programming, applied to makespan minimization on uniformly related machines
- Exact and approximate algorithms for high-multiplicity scheduling with rejection on parallel machines
- High-multiplicity cyclic job shop scheduling
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem
This page was built for publication: Exact and approximate algorithms for high-multiplicity parallel machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041349)
