Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time

DOI10.1142/s0217595922400115zbMath1525.90214OpenAlexW4213245831WikidataQ113343362 ScholiaQ113343362MaRDI QIDQ6053499

Yujia Huo, Cuixia Miao, Ran Ma, Fanyu Kong, Juan Zou

Publication date: 19 October 2023

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595922400115

zbMATH Keywords

schedulingpolynomial time algorithmstrongly NP-hardstep-deteriorating

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Modeling the parallel machine scheduling problem with step deteriorating jobs
• Time-dependent scheduling
• Single machine scheduling with start time dependent processing times: Some solvable cases
• A concise survey of scheduling with time-dependent processing times
• Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
• Scheduling with step-deteriorating jobs to minimize the makespan
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
• Batch scheduling with step-deteriorating processing times to minimize flowtime
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single machine scheduling with step-deteriorating processing times

This page was built for publication: Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time