Resource management in machine scheduling problems: a survey

DOI10.7494/DMMS.2007.1.2.59MaRDI QIDQ3011186zbMATH OpenOpenAlexWikidataFDO

Authors Adam Janiak, Władysław Janiak, Maciej Lichtenstein

Publication date 28 June 2011

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

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

zbMATH Keywords

resource allocationresource dependent processing timesresource dependent release datesscheduling

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 4072697
• Single machine scheduling subject to deadlines and resource dependent processing times
• Single machine scheduling problems with resource dependent processing times
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• scientific article; zbMATH DE number 1859296

Cited in

(18)

• Scheduling shared continuous resources on many-cores
• Single-machine group scheduling with processing times dependent on position, starting time and allotted resource
• Approximation schemes for parallel machine scheduling with non-renewable resources
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
• Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
• Algorithms of transport paths for scheduling problem with state dependent resources
• Two-machine flow shop scheduling with convex resource consumption functions
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
• Bicriteria permutation flow shop scheduling problems with machine-dependent convex resource consumption functions
• Minimizing total completion time in single-machine scheduling with convex resource consumption and job rejection
• A preemptive single-machine scheduling problem with a late work criterion and convex resource consumption functions
• A linear-time algorithm for a resource-dependent preemptive late-work scheduling problem
• Complexity of a scheduling problem with controllable processing times
• Just-in-time scheduling with controllable processing times on parallel machines

This page was built for publication: Resource management in machine scheduling problems: a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011186)