Discrete-continuous scheduling problems -- mean completion time results
From MaRDI portal
Publication:1278310
DOI10.1016/0377-2217(96)00130-0zbMath0953.90521MaRDI QIDQ1278310
Joanna Józefowska, Jan Weglarz
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(96)00130-0
90B35: Deterministic scheduling theory in operations research
Related Items
Resource level minimization in the discrete-continuous scheduling, Scheduling shared continuous resources on many-cores, Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
Cites Work
- On a methodology for discrete-continuous scheduling
- Approximation algorithms for some discrete-continuous scheduling problems
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
- Unnamed Item
- Unnamed Item