Parallel-machine scheduling with time-dependent and machine availability constraints

DOI10.1155/2015/956158zbMath1394.90294OpenAlexW1891127169WikidataQ59120038 ScholiaQ59120038MaRDI QIDQ1667046

Cuixia Miao, Juan Zou

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/956158

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Formulations, features of solution space, and algorithms for line-pure \textit{seru} system conversion

Cites Work

• Unnamed Item
• Approximation algorithms for parallel machine scheduling with linear deterioration
• Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
• Parallel-machine scheduling of simple linear deteriorating jobs
• Time-dependent scheduling
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• A concise survey of scheduling with time-dependent processing times
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Machine scheduling with an availability constraint
• SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS
• Scheduling Deteriorating Jobs on a Single Processor
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

This page was built for publication: Parallel-machine scheduling with time-dependent and machine availability constraints