Scheduling jobs with controllable processing times as an optimal control problem

DOI10.1080/00207178408933210zbMath0529.90058OpenAlexW2087725838MaRDI QIDQ3312009

Eugeniusz Nowicki, Stanisław Zdrzałka

Publication date: 1984

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207178408933210

zbMATH Keywords

optimal schedulecompletion timeweighted flow timecontrollable processing timessingle processorsimultaneous processingprocessing time control by resource allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Batch scheduling of identical jobs with controllable processing times ⋮ Pre-emptive scheduling problems with controllable processing times ⋮ Scheduling two agents with controllable processing times

Cites Work

• Project Scheduling with Discrete and Continuous Resources
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Optimal control of a complex of independent operations
• Controlled jump process models for stochastic scheduling problems
• A hamiltonian approach to optimal stochastic resource allocation

This page was built for publication: Scheduling jobs with controllable processing times as an optimal control problem