Pages that link to "Item:Q3634981"
From MaRDI portal
The following pages link to The Batch Loading and Scheduling Problem (Q3634981):
Displaying 44 items.
- Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
- Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882) (← links)
- Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size (Q541698) (← links)
- Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop (Q879285) (← links)
- Model approximation for batch flow shop scheduling with fixed batch sizes (Q896496) (← links)
- Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem (Q940867) (← links)
- Multiple orders per job batch scheduling with incompatible jobs (Q940891) (← links)
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- Real-time scheduling of an automated manufacturing center (Q1116883) (← links)
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times (Q1762129) (← links)
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives (Q1788999) (← links)
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
- The battery switching station scheduling problem (Q1939710) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- Online scheduling of incompatible unit-length job families with lookahead (Q2250449) (← links)
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs (Q2331580) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
- Single-machine batch scheduling with job processing time compatibility (Q2342681) (← links)
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (Q2410362) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605) (← links)
- A solution framework for scheduling a BPM with non-identical job dimensions (Q2468858) (← links)
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines (Q3636744) (← links)
- Dynamic scheduling of batch servers with compatible product families (Q4666778) (← links)
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312) (← links)
- Adaptive scheduling of batch servers in flow shops (Q4710093) (← links)
- An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart (Q5024917) (← links)
- A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← links)
- Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs (Q5265640) (← links)
- Dynamic scheduling of batch-processing machines with non-identical product sizes (Q5438667) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing (Q6135730) (← links)
- Parallel batching with multi-size jobs and incompatible job families (Q6168657) (← links)
