The following pages link to Scheduling a batching machine (Q1268850):
Displaying 50 items.
- Integrated problem of soaking pit heating and hot rolling scheduling in steel plants (Q2003439) (← links)
- Single machine batch scheduling with two non-disjoint agents and splitable jobs (Q2023129) (← links)
- Revisit of the scheduling problems with integrated production and delivery on parallel batching machines (Q2039677) (← links)
- Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop (Q2044553) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- On lower and upper bounds for single machine parallel batch scheduling (Q2091210) (← links)
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan (Q2172079) (← links)
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives (Q2176838) (← links)
- Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
- Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) (← links)
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189) (← links)
- The piggyback transportation problem: transporting drones launched from a flying warehouse (Q2242297) (← links)
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← links)
- Minimizing the makespan on a single parallel batching machine (Q2268874) (← links)
- Scheduling parallel batching machines in a sequence (Q2283298) (← links)
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity (Q2286437) (← links)
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs (Q2331580) (← links)
- Logic-based Benders decomposition for scheduling a batching machine (Q2333133) (← links)
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532) (← links)
- Single-machine batch scheduling with job processing time compatibility (Q2342681) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Improved MILP models for two-machine flowshop with batch processing machines (Q2389826) (← links)
- Parallel batch scheduling with nested processing set restrictions (Q2402265) (← links)
- Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
- A note on special optimal batching structures to minimize total weighted completion time (Q2426655) (← links)
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519) (← links)
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
- Minimizing makespan on a single batching machine with release times and non-identical job sizes (Q2488218) (← links)
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← links)
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2574421) (← links)
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine (Q2576877) (← links)
- Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint (Q2657417) (← links)
- Just-in-time single-batch-processing machine scheduling (Q2669787) (← 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)
- Minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2741217) (← links)
- On minimizing total tardiness in a serial batching problem (Q2765603) (← links)
