Scheduling on parallel machines considering job-machine dependency constraints
From MaRDI portal
Publication:2883591
DOI10.1016/j.endm.2010.05.055zbMath1237.90087OpenAlexW2000264628MaRDI QIDQ2883591
Mitre C. Dourado, R. de F. Rodrigues, Jayme Luiz Szwarcfiter
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.055
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- Complexity of scheduling problems with multi-purpose machines
- Complexity results for single-machine problems with positive finish-start time-lags
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling independent tasks to reduce mean finishing time
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Technical Note—Minimizing Average Flow Time with Parallel Machines