Preemptive scheduling with staircase and piecewise linear resource availability

DOI10.1007/BF01416077MaRDI QIDQ3830806zbMATH OpenOpenAlexFDO

Authors Dominique De Werra, Roman Słowiński, Maurice Cochand

Publication date 1989

Published in ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01416077

zbMATH Keywords

flexible manufacturing systemsnonrenewable resourcespreemptive schedulingresource constraintstime-varying supplytotally unimodular matricestwo-phase methodunrelated processors

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Production models (90B30) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the two-phase method for preemptive scheduling
• Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
• Scheduling preemptable tasks on parallel processors with limited availability
• Almost nonpreemptive schedules
• On preemptive scheduling: A general setting for the two-phase method

Cites work

• A decomposition property of polyhedra
• Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints
• scientific article; zbMATH DE number 3722085 (Why is no real title available?)
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Preemptive Scheduling, Linear Programming and Network Flows
• Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
• Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study

Cited in

(13)

• On the two-phase method for preemptive scheduling
• Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
• On preemptive scheduling: A general setting for the two-phase method
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods)
• Stochastic scheduling to minimize expected maximum lateness
• A preemptive open shop scheduling problem with one resource
• Preemptive Scheduling, Linear Programming and Network Flows
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
• Fifty years of research in scheduling -- theory and applications
• Mathematical programming formulations for machine scheduling: A survey
• Almost nonpreemptive schedules

This page was built for publication: Preemptive scheduling with staircase and piecewise linear resource availability

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