Pages that link to "Item:Q1781801"
From MaRDI portal
The following pages link to On-line scheduling algorithms for a batch machine with finite capacity (Q1781801):
Displaying 41 items.
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
- Optimal on-line algorithms for one batch machine with grouped processing times (Q411231) (← links)
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead (Q413308) (← links)
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times (Q423933) (← links)
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882) (← links)
- Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251) (← links)
- Single machine batch scheduling with release times (Q732326) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
- On-line scheduling on a batch machine to minimize makespan with limited restarts (Q935242) (← links)
- Optimal online-list batch scheduling (Q990939) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
- On-line scheduling with delivery time on a single batch machine (Q1022586) (← links)
- Online scheduling in a parallel batch processing system to minimize makespan using restarts (Q1022602) (← links)
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← links)
- On-line integrated production-distribution scheduling problems with capacitated deliveries (Q1042489) (← links)
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart (Q1666180) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- Algorithms for on-line order batching in an order picking warehouse (Q1761193) (← links)
- A flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times (Q1944199) (← links)
- Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart (Q2250440) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- Online unbounded batch scheduling on parallel machines with delivery times (Q2354308) (← links)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
- Research on the parallel-batch scheduling with linearly lookahead model (Q2666738) (← links)
- An on-line LS algorithm for some \(Q_m|r_j|C_{\max}\) scheduling (Q2780944) (← links)
- Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines (Q2931174) (← links)
- A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (Q2931730) (← links)
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE (Q3397511) (← links)
- (Q4528340) (← links)
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead (Q5241278) (← links)
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval (Q6053500) (← links)
- Approximation algorithms for batch scheduling with processing set restrictions (Q6124768) (← links)