Pages that link to "Item:Q2076906"
From MaRDI portal
The following pages link to A survey of scheduling with parallel batch (p-batch) processing (Q2076906):
Displaying 26 items.
- Scheduling with batching: A review (Q1969826) (← links)
- Online scheduling of two-machine flowshop with lookahead and incompatible job families (Q2111531) (← links)
- A load-balancing problem for distributed bulk-service queues with size-dependent batch processing times (Q2146420) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- Flexible job shop scheduling problem for parallel batch processing machine with compatible job families (Q2290149) (← links)
- Research on the parallel-batch scheduling with linearly lookahead model (Q2666738) (← links)
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time (Q2676295) (← links)
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost (Q2680241) (← links)
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097) (← links)
- PSBS: Practical Size-Based Scheduling (Q2985398) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- Exact methods for the oven scheduling problem (Q6049438) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
- Novel model and solution method for flexible job shop scheduling problem with batch processing machines (Q6065642) (← links)
- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches (Q6090154) (← links)
- Literature reviews in operations research: a new taxonomy and a meta review (Q6106580) (← links)
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions (Q6112735) (← links)
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)
- Parallel batching with multi-size jobs and incompatible job families (Q6168657) (← links)
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161) (← links)
- Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm (Q6551161) (← links)
- Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing (Q6556084) (← links)
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems (Q6572836) (← links)
- Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines (Q6609697) (← links)
- Serial batching to minimize the weighted number of tardy jobs (Q6657883) (← links)
