Preemptive scheduling with staircase and piecewise linear resource availability

DOI10.1007/BF01416077zbMath0675.90045OpenAlexW1998418916MaRDI QIDQ3830806

Slowinski, Roman, Dominique de Werra, Maurice Cochand

Publication date: 1989

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 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 systemspreemptive schedulingnonrenewable resourcesresource constraintstwo-phase methodtotally unimodular matricesunrelated processorstime-varying supply

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints
• Preemptive Scheduling, Linear Programming and Network Flows
• A decomposition property of polyhedra
• Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
• Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming