Online scheduling on bounded batch machines to minimize the maximum weighted completion time
From MaRDI portal
Publication:1656199
DOI10.1007/s40305-017-0179-xzbMath1413.90095OpenAlexW2766772614MaRDI QIDQ1656199
Publication date: 10 August 2018
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-017-0179-x
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (5)
Online NDP-constraint scheduling of jobs with delivery times or weights ⋮ Single-machine online scheduling of jobs with non-delayed processing constraint ⋮ Medical rolling bearing fault prognostics based on improved extreme learning machine ⋮ Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode ⋮ Online algorithms to schedule a proportionate flexible flow shop of batching machines
Cites Work
- Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
- Two-agent scheduling to minimize the total cost
- Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
- Online over time scheduling on parallel-batch machines: a survey
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Scheduling a batching machine
- Scheduling one batch processor subject to job release dates
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line algorithms for minimizing makespan on batch processing machines
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
This page was built for publication: Online scheduling on bounded batch machines to minimize the maximum weighted completion time
