Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan

DOI10.1142/S0217595916500482zbMath1356.90060OpenAlexW2558361976MaRDI QIDQ2956870

Chuan-Li Zhao, Heng-Yong Tang

Publication date: 19 January 2017

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

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

zbMATH Keywords

schedulingdeteriorating jobsmakespanmachine availability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Time-dependent scheduling
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• The single-machine total weighted tardiness scheduling problem with position-based learning effects
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION
• SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION
• SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem

This page was built for publication: Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan