On-line algorithms for minimizing makespan on batch processing machines
From MaRDI portal
Publication:2741218
DOI10.1002/nav.5zbMath1018.90017OpenAlexW2076671014MaRDI QIDQ2741218
No author found.
Publication date: 15 September 2003
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.5
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (max. 100)
The shortest first coordination mechanism for a scheduling game with parallel-batching machines ⋮ Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine ⋮ Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart ⋮ Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine ⋮ On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs ⋮ A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times ⋮ A best possible on-line algorithm for scheduling on uniform parallel-batch machines ⋮ Online scheduling on bounded batch machines to minimize the maximum weighted completion time ⋮ Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time ⋮ Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines ⋮ Research on the parallel-batch scheduling with linearly lookahead model ⋮ Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ Semi-online scheduling: a survey ⋮ An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities ⋮ Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval ⋮ Online Single Machine Scheduling to Minimize the Maximum Starting Time ⋮ Optimal on-line algorithms for one batch machine with grouped processing times ⋮ Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions ⋮ Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead ⋮ Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time ⋮ An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times ⋮ An improved on-line algorithm for single parallel-batch machine scheduling with delivery times ⋮ A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines ⋮ On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time ⋮ Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs ⋮ Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan ⋮ An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan ⋮ Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan ⋮ A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan ⋮ On-line scheduling on a batch machine to minimize makespan with limited restarts ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ The medical laboratory scheduling for weighted flow-time ⋮ Online batch scheduling with kind release times and incompatible families to minimize makespan ⋮ A coordination mechanism for a scheduling game with parallel-batching machines ⋮ An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines ⋮ Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart ⋮ Online scheduling of incompatible unit-length job families with lookahead ⋮ Online scheduling on unbounded parallel-batch machines with incompatible job families ⋮ Best semi-online algorithms for unbounded parallel batch scheduling ⋮ Algorithms for on-line order batching in an order picking warehouse ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ Stochastic scheduling on parallel machines to minimize discounted holding costs ⋮ A flexible on-line scheduling algorithm for batch machine with infinite capacity ⋮ On-line scheduling algorithms for a batch machine with finite capacity ⋮ Online batch scheduling on parallel machines with delivery times ⋮ Optimal online-list batch scheduling ⋮ Online scheduling on unbounded parallel-batch machines to minimize the makespan ⋮ Single machine batch scheduling with release times ⋮ On-line scheduling with delivery time on a single batch machine ⋮ Online scheduling in a parallel batch processing system to minimize makespan using restarts ⋮ OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead ⋮ Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead ⋮ On-line integrated production-distribution scheduling problems with capacitated deliveries ⋮ Online algorithms to schedule a proportionate flexible flow shop of batching machines ⋮ On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ Online scheduling of two-machine flowshop with lookahead and incompatible job families ⋮ An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart ⋮ Online unbounded batch scheduling on parallel machines with delivery times
This page was built for publication: On-line algorithms for minimizing makespan on batch processing machines
