Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
DOI10.1016/j.dam.2013.10.003zbMath1320.90029OpenAlexW1970477454MaRDI QIDQ2255056
Mateusz Gorczyca, Adam Janiak, Wladyslaw Janiak, Marcin Dymański
Publication date: 6 February 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.003
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Cites Work
- Unnamed Item
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- Optimal control policies for resource allocation in an activity network
- Resource level minimization in the discrete-continuous scheduling
- Time-optimal control in a single machine problem with resource constraints
- Discrete-continuous scheduling problems -- mean completion time results
- On a methodology for discrete-continuous scheduling
- Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
This page was built for publication: Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
