Parallel-machine scheduling with time-dependent and machine availability constraints
From MaRDI portal
Publication:1667046
DOI10.1155/2015/956158zbMATH Open1394.90294OpenAlexW1891127169WikidataQ59120038 ScholiaQ59120038MaRDI QIDQ1667046FDOQ1667046
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
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
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Time-dependent scheduling
- Scheduling Deteriorating Jobs on a Single Processor
- A concise survey of scheduling with time-dependent processing times
- Machine scheduling with an availability constraint
- Parallel-machine scheduling of simple linear deteriorating jobs
- Title not available (Why is that?)
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
- Approximation algorithms for parallel machine scheduling with linear deterioration
- 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
- Single-machine scheduling with proportionally deteriorating jobs subject to availability constraints
Cited In (8)
- Title not available (Why is that?)
- Parallel-machine scheduling with potential disruption and positional-dependent processing times
- Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- Optimal parallel machines scheduling with availability constraints
- Machine scheduling with availability constraints
- Title not available (Why is that?)
- Formulations, features of solution space, and algorithms for line-pure \textit{seru} system conversion
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)
