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

DOI10.1155/2015/956158MaRDI QIDQ1667046zbMATH OpenOpenAlexWikidataFDO

Authors Cuixia Miao, Juan Zou

Publication date 27 August 2018

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

Copyright license Creative Commons Attribution 3.0 Unported

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Parallel machines scheduling with deteriorating jobs and availability constraints
• Parallel machine scheduling with time dependent processing times
• scientific article; zbMATH DE number 6672186
• Scheduling deteriorating jobs with availability constraints to minimize the makespan
• Parallel-machine scheduling with time dependent processing times

Cites work

• scientific article; zbMATH DE number 1389747 (Why is no real title available?)
• A concise survey of scheduling with time-dependent processing times
• Approximation algorithms for parallel machine scheduling with linear deterioration
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs
• Machine scheduling with an availability constraint
• Parallel-machine scheduling of simple linear deteriorating jobs
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
• Single-machine scheduling with proportionally deteriorating jobs subject to availability constraints
• Time-dependent scheduling
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(15)

• Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration
• Machine scheduling with availability constraints
• Scheduling two parallel machines with machine-dependent availabilities
• Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
• scientific article; zbMATH DE number 6672186 (Why is no real title available?)
• Optimal parallel machines scheduling with availability constraints
• scientific article; zbMATH DE number 6453531 (Why is no real title available?)
• Parallel-machine scheduling with potential disruption and positional-dependent processing times
• Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
• Parallel-machine scheduling with non-simultaneous machine available time
• Parallel machines scheduling with deteriorating jobs and availability constraints
• Formulations, features of solution space, and algorithms for line-pure \textit{seru} system conversion
• Two parallel-machine scheduling problems with function constraint
• Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
• Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times

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

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