Scheduling on parallel identical machines to minimize total tardiness
From MaRDI portal
Publication:856206
DOI10.1016/J.EJOR.2005.09.038zbMATH Open1111.90046OpenAlexW2055405237MaRDI QIDQ856206FDOQ856206
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.038
Recommendations
- Minimizing total tardiness in an unrelated parallel-machine scheduling problem
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Two-machine flowshop scheduling to minimize total tardiness
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing Total Tardiness on One Machine is NP-Hard
- Title not available (Why is that?)
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- A tabu search algorithm for parallel machine total tardiness problem
- A backward approach in list scheduling algorithms for multi-machine tardiness problems
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Minimizing total tardiness in an unrelated parallel-machine scheduling problem
- A heuristic for the single machine tardiness problem
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Minimizing total tardiness in permutation flowshops
- Title not available (Why is that?)
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
- The Total Tardiness Problem: Review and Extensions
- Heuristics for minimizing mean tardiness form parallel machines
- Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
- Scheduling with Deadlines and Loss Functions on k Parallel Machines
- Technical Note—A Note on the Weighted Tardiness Problem
- Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
Cited In (48)
- On the mass COVID-19 vaccination scheduling problem
- List scheduling algorithms to minimize the makespan on identical parallel machines
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Interval scheduling on identical machines
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Schedule grouped jobs on parallel machines with single mold constraint
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
- On the exact solution of a large class of parallel machine scheduling problems
- Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
- Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs
- Order assignment and scheduling under processing and distribution time uncertainty
- A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
- Practical solutions for a dock assignment problem with trailer transportation
- Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling
- Minimizing total tardiness in an unrelated parallel-machine scheduling problem
- Scheduling identical parallel machines with tooling constraints
- A united search particle swarm optimization algorithm for multiobjective scheduling problem
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
- Approximating Real-Time Scheduling on Identical Machines
- Heuristic algorithms for a complex parallel machine scheduling problem
- Scheduling with uncertain processing times in mixed-criticality systems
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Acquisition planning and scheduling of computing resources
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm
- Dynamic scheduling of patients in emergency departments
- Job Tardiness in Unequal Parallel Processor Systems
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- Sequential scheduling on identical machines
This page was built for publication: Scheduling on parallel identical machines to minimize total tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856206)
