Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms

DOI10.1016/j.dam.2013.10.003zbMath1320.90029MaRDI 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

zbMATH Keywords

computational complexity; scheduling; metaheuristics; resource allocation

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function, A unified view of parallel machine scheduling with interdependent processing rates

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