Fast LP models and algorithms for identical jobs on uniform parallel machines
From MaRDI portal
(Redirected from Publication:727360)
Recommendations
- Scheduling identical jobs on uniform parallel machines under position-based learning effects
- Scheduling identical jobs on uniform parallel machines
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Scheduling equal-length jobs on identical parallel machines
- Batch scheduling of identical jobs on parallel identical machines
Cites work
- scientific article; zbMATH DE number 1128827 (Why is no real title available?)
- scientific article; zbMATH DE number 2119001 (Why is no real title available?)
- A decomposition algorithm for the single machine total tardiness problem
- A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- A state-of-the-art review on scheduling with learning effects
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
- Mathematical programming formulations for machine scheduling: A survey
- Minimizing the number of machines for scheduling jobs with equal processing times
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing the weighted number of tardy jobs on parallel processors
- On a parallel machine scheduling problem with equal processing times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Scheduling equal-length jobs on identical parallel machines
- Scheduling identical jobs on uniform parallel machines
- Scheduling identical jobs with chain precedence constraints on two uniform machines
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Scheduling problems with a learning effect
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Scheduling with general job-dependent learning curves.
- Scheduling. Theory, algorithms, and systems.
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
Cited in
(6)- Scheduling identical jobs on uniform parallel machines under position-based learning effects
- Uniform parallel machine scheduling with resource consumption constraint
- Novel model and solution method for flexible job shop scheduling problem with batch processing machines
- Parallel machine scheduling with tool loading
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
This page was built for publication: Fast LP models and algorithms for identical jobs on uniform parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727360)
