The following pages link to Scheduling a batching machine (Q1268850):
Displaying 32 items.
- Minimizing total completion time on a batching machine with job processing time compatibilities (Q2861568) (← links)
- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries (Q2867109) (← links)
- Two problems about single machine parallel batching with batching costs (Q2916672) (← links)
- Minimizing the sum of the total completion time and batching costs on a batch processing machine (Q2916934) (← links)
- BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN (Q2931723) (← links)
- A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (Q2931730) (← links)
- No-Wait Scheduling Problems with Batching Machines (Q2958672) (← links)
- A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING (Q3021988) (← links)
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING (Q3022023) (← links)
- SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION (Q3069759) (← links)
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times (Q3082645) (← links)
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective (Q3156721) (← links)
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292) (← links)
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES (Q3421855) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- (Q4365136) (← links)
- Hierarchical optimization on an unbounded parallel-batching machine (Q4579881) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times (Q5444602) (← links)
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes (Q5478853) (← links)
- Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)
- Scheduling a proportionate flow shop of batching machines (Q5919041) (← links)
- Scheduling batches with simultaneous job processing for two-machine shop problems (Q5932282) (← links)
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure (Q5959373) (← links)
- Exact methods for the oven scheduling problem (Q6049438) (← links)
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)
- Approximation algorithms for batch scheduling with processing set restrictions (Q6124768) (← links)
- A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing (Q6135730) (← links)
- Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components (Q6135731) (← links)
- A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses (Q6620469) (← links)
- Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine (Q6664884) (← links)
