Scheduling problem with multi-purpose parallel machines

DOI10.1016/j.dam.2011.11.033zbMath1335.90046OpenAlexW1998558026MaRDI QIDQ496686

Mitre C. Dourado, Rosiane de Freitas Rodrigues, Jayme Luiz Szwarcfiter

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.033

zbMATH Keywords

algorithmsscheduling theoryunit penalty functionunit time jobs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Scheduling jobs with equal processing times and time windows on identical parallel machines
• 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
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling problem with multi-purpose parallel machines