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

DOI10.1142/S0217595922400115MaRDI QIDQ6053499zbMATH OpenOpenAlexWikidataFDO

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

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

polynomial time algorithmschedulingstep-deterioratingstrongly NP-hard

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
• Modeling the parallel machine scheduling problem with step deteriorating jobs
• Parallel Processing and Applied Mathematics
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
• Scheduling jobs on parallel machines to minimize a regular step total cost function
• Scheduling with step-deteriorating jobs to minimize the makespan
• Parallel machine scheduling problems with proportionally deteriorating jobs
• Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration
• Scheduling parallel machines to minimize total weighted and unweighted tardiness

Cites work

• A concise survey of scheduling with time-dependent processing times
• 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
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
• Modeling the parallel machine scheduling problem with step deteriorating jobs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling with step-deteriorating jobs to minimize the makespan
• Single machine scheduling with start time dependent processing times: Some solvable cases
• Single machine scheduling with step-deteriorating processing times
• Time-dependent scheduling

Cited in

(5)

• Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
• Permutation flow shop scheduling with makespan objective and truncated learning effects
• Earliness-tardiness scheduling with delivery times and deteriorating jobs
• Different due-window assignment scheduling with deterioration effects
• Single-machine scheduling with step-deteriorating jobs and rejection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053499)