Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation

DOI10.1287/mnsc.33.8.1001zbMath0636.90044OpenAlexW2132278110MaRDI QIDQ3777787

Moshe Dror, Jan Karel Lenstra, Jelman I. Stern

Publication date: 1987

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.33.8.1001

zbMATH Keywords

makespanlogisticsmultiple parallel processorscommon power sourcen job - m machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ A note on scheduling on a single processor with speed dependent on a number of executed jobs ⋮ Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ A variant of the permutation flow shop model with variable processing times ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ Scheduling malleable tasks with interdependent processing rates: comments and observations ⋮ Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms ⋮ KBSS: A knowledge-based system for scheduling in automated manufacturing ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ Discrete-continuous scheduling problems -- mean completion time results ⋮ Resource level minimization in the discrete-continuous scheduling ⋮ Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs ⋮ A priority-rule method for project scheduling with work-content constraints ⋮ On a methodology for discrete-continuous scheduling ⋮ Optimal control of a class of DEDS: Flow-shops with state-dependent processing times ⋮ Mathematical programming formulations for machine scheduling: A survey