Fast LP models and algorithms for identical jobs on uniform parallel machines
From MaRDI portal
Publication:727360
DOI10.1016/J.APM.2012.07.023zbMATH Open1351.90099OpenAlexW2066649032MaRDI QIDQ727360FDOQ727360
Publication date: 6 December 2016
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2012.07.023
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
Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling
- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Mathematical programming formulations for machine scheduling: A survey
- A state-of-the-art review on scheduling with learning effects
- Title not available (Why is that?)
- On a parallel machine scheduling problem with equal processing times
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Scheduling equal-length jobs on identical parallel machines
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
- Scheduling identical jobs on uniform parallel machines
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
- Scheduling with general job-dependent learning curves.
- Parallel machine scheduling with a learning effect
- Scheduling problems with a learning effect
- A decomposition algorithm for the single machine total tardiness problem
- Minimizing the number of machines for scheduling jobs with equal processing times
- A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
- Minimizing the weighted number of tardy jobs on parallel processors
- Title not available (Why is that?)
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
- Scheduling identical jobs with chain precedence constraints on two uniform machines
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
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)
