Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources

DOI10.7494/dmms.2011.5.1.5zbMath1245.90030OpenAlexW2150526576WikidataQ129562689 ScholiaQ129562689MaRDI QIDQ2902362

Mateusz Gorczyca, Adam Janiak, Wladyslaw Janiak

Publication date: 19 August 2012

Published in: Decision Making in Manufacturing and Services (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/dmms.2011.5.1.5

zbMATH Keywords

optimizationschedulingresource allocationneighbourhood

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms ⋮ A unified view of parallel machine scheduling with interdependent processing rates

This page was built for publication: Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources