Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
From MaRDI portal
Publication:3777787
DOI10.1287/MNSC.33.8.1001zbMATH Open0636.90044OpenAlexW2132278110MaRDI QIDQ3777787FDOQ3777787
Authors: Moshe Dror, Jelman I. Stern, Jan Karel Lenstra 
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
Recommendations
- Parallel machine scheduling with time dependent processing times
- Parallel-machine scheduling with time dependent processing times
- Parallel machine scheduling with special jobs
- Parallel machine scheduling with splitting jobs
- Scheduling parallel batch processing machines with non-identical job sizes
- Parallel machine scheduling with high multiplicity
- scientific article; zbMATH DE number 838793
- Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times
- A unified view of parallel machine scheduling with interdependent processing rates
- Scheduling jobs on parallel machines with sequence-dependent setup times
Cited In (17)
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- A unified view of parallel machine scheduling with interdependent processing rates
- Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
- On a methodology for discrete-continuous scheduling
- A state-of-the-art review of parallel-machine scheduling research
- Mathematical programming formulations for machine scheduling: A survey
- KBSS: A knowledge-based system for scheduling in automated manufacturing
- A priority-rule method for project scheduling with work-content constraints
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
- Resource level minimization in the discrete-continuous scheduling
- Scheduling malleable tasks with interdependent processing rates: comments and observations
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- Processing time generation schemes for parallel machine scheduling problems with various correlation structures
- Discrete-continuous scheduling problems -- mean completion time results
- A variant of the permutation flow shop model with variable processing times
This page was built for publication: Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777787)
