A unified view of parallel machine scheduling with interdependent processing rates
From MaRDI portal
Publication:2286430
DOI10.1007/s10951-019-00605-xzbMath1430.90242OpenAlexW2924966013WikidataQ128130025 ScholiaQ128130025MaRDI QIDQ2286430
Haibo Wang, R. Bryan Kethley, Bahram Alidaee, Frank G. Landram
Publication date: 22 January 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-019-00605-x
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ Research on construction and application for the model of multistage job shop scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An effective approach for scheduling coupled activities in development projects
- Integrated staffing and scheduling for an aircraft line maintenance problem
- Scheduling with general position-based learning curves
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Scheduling jobs on a single machine to maximize the total revenue of jobs
- Resource level minimization in the discrete-continuous scheduling
- A priority-rule method for project scheduling with work-content constraints
- Scheduling on machines with variable service rates
- Approximation schemes for scheduling on parallel machines
- One-machine job-scheduling with non-constant capacity -- minimizing weighted completion times
- Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
- On a methodology for discrete-continuous scheduling
- Two parallel machine sequencing problems involving controllable job processing times
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- A concise survey of scheduling with time-dependent processing times
- Machine scheduling with a rate-modifying activity
- Scheduling with general job-dependent learning curves.
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Scheduling a batching machine with convex resource consumption functions
- Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
- A survey of scheduling with controllable processing times
- A state-of-the-art review on scheduling with learning effects
- Scheduling malleable tasks with interdependent processing rates: comments and observations
- Parallel machine scheduling with a convex resource consumption function
- Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources
- Scheduling Problems with Learning and Ageing Effects: A Survey
- Scheduling with time dependent processing times: Review and extensions
- Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time
- On Minimizing Flow Time on Processors with Variable Unit Processing Time
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Sequencing independent jobs with a single resource
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
- Preemptive Scheduling of Uniform Processor Systems
- Minimization of Time-Varying Costs in Single-Machine Scheduling
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Optimal Strategies for Multiclass Job Scheduling on a Single Machine With Controllable Processing Times
- Optimization of a Flow Shop System of Initially Controllable Machines
- Constrained Optimal Hybrid Control of a Flow Shop System
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: A unified view of parallel machine scheduling with interdependent processing rates
