On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs

DOI10.1007/s40305-018-0207-5zbMath1449.90114OpenAlexW2805934513MaRDI QIDQ2176833

Wen-Chang Luo

Publication date: 5 May 2020

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-018-0207-5

zbMATH Keywords

schedulingdue datepolynomial time algorithmrate-modifying activity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing ⋮ A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production

Cites Work

• Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
• Scheduling with job-dependent learning effects and multiple rate-modifying activities
• Necessary and sufficient conditions of optimality for some classical scheduling problems
• Two-parallel machines scheduling with rate-modifying activities to minimize total completion time
• A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
• Machine scheduling with a rate-modifying activity
• Minimizing the number of late jobs when the start time of the machine is variable
• A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
• Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
• Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
• Planning Machine Maintenance in Two-Machine Shop Scheduling
• Approximation Algorithms for Scheduling with a Variable Machine Maintenance
• Scheduling a deteriorating maintenance activity on a single machine
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs