The following pages link to Batching identical jobs (Q1401637):
Displaying 39 items.
- Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types (Q276548) (← links)
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- The lockmaster's problem (Q322695) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Batch scheduling of identical jobs on parallel identical machines (Q456112) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
- A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253) (← links)
- Optimally competitive list batching (Q837154) (← links)
- Bicriterion scheduling with equal processing times on a batch processing machine (Q947947) (← links)
- A polynomial algorithm for a one machine batching problem (Q1197905) (← links)
- Scheduling a batching machine (Q1268850) (← links)
- The complexity of one-machine batching problems (Q1315991) (← links)
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. (Q1413926) (← links)
- Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063) (← links)
- On scheduling an unbounded batch machine (Q1870002) (← links)
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- A bi-criteria optimization model for medical device sterilization (Q2212292) (← links)
- Scheduling parallel batching machines in a sequence (Q2283298) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Integrated batch sizing and scheduling on a single machine (Q2434256) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- On minimizing total tardiness in a serial batching problem (Q2765603) (← links)
- The competing job sets scheduling problems with two types of release dates on batching machine (Q3307381) (← links)
- Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations (Q5168017) (← links)
- Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities (Q5270518) (← links)
- Cost-sharing games in real-time scheduling systems (Q5918882) (← links)
- Scheduling a proportionate flow shop of batching machines (Q5919041) (← links)
- Cost-sharing games in real-time scheduling systems (Q5925633) (← links)
- A note on batch scheduling on a two-machine flowshop with machine-dependent processing times (Q6054015) (← links)
- Serial batching to minimize the weighted number of tardy jobs (Q6657883) (← links)
