Scheduling jobs with controllable processing times as an optimal control problem

DOI10.1080/00207178408933210MaRDI QIDQ3312009zbMATH OpenOpenAlexFDO

Authors 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

completion timecontrollable processing timesoptimal scheduleprocessing time control by resource allocationsimultaneous processingsingle processorweighted flow time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

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

Cited in

(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

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

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