The following pages link to Scheduling a batching machine (Q1268850):
Displaying 50 items.
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
- Integrated production and delivery on parallel batching machines (Q320081) (← links)
- The lockmaster's problem (Q322695) (← links)
- Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
- Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
- Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing (Q342170) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Batch scheduling with deteriorating jobs to minimize the total completion time (Q384194) (← links)
- Optimal on-line algorithms for one batch machine with grouped processing times (Q411231) (← links)
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
- Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← links)
- A two stage scheduling with transportation and batching (Q456105) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
- A note on unbounded parallel-batch scheduling (Q495685) (← links)
- Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882) (← links)
- Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087) (← links)
- Unbounded batch scheduling with a common due window on a single machine (Q611087) (← links)
- On the max-weight edge coloring problem (Q613668) (← links)
- Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
- On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556) (← links)
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (Q656603) (← links)
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251) (← links)
- On the max coloring problem (Q690449) (← links)
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness (Q690456) (← links)
- Batching decisions for assembly production systems (Q703918) (← links)
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
- Optimally competitive list batching (Q837154) (← links)
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
- Makespan minimization in a no-wait flow shop problem with two batching machines (Q856680) (← links)
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← links)
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (Q924888) (← links)
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
- Bicriterion scheduling with equal processing times on a batch processing machine (Q947947) (← links)
- Flowshop scheduling problem with a batching machine and task compatibilities (Q954038) (← links)
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356) (← links)
- The coordination of transportation and batching scheduling (Q965544) (← links)
- Optimal methods for batch processing problem with makespan and maximum lateness objectives (Q967805) (← links)
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
