Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
DOI10.1016/j.apm.2009.08.023zbMath1193.90105OpenAlexW2084969140MaRDI QIDQ988377
Abalfazl Zareei, Farzad Zaerpour, Ali Hajinezhad, Mohammad Mahdavi Mazdeh
Publication date: 26 August 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2009.08.023
parallel machinesmachine deteriorationscheduling and sequencingjob deteriorationmulti-objectives integer programming
Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (19)
Uses Software
Cites Work
- Unnamed Item
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Scheduling jobs under decreasing linear deterioration
- Job sequencing rules for minimizing the expected makespan in flexible machines
- A tabu search algorithm for parallel machine total tardiness problem
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
- Scheduling Deteriorating Jobs on a Single Processor
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
This page was built for publication: Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs