Pages that link to "Item:Q1969826"
From MaRDI portal
The following pages link to Scheduling with batching: A review (Q1969826):
Displaying 50 items.
- Two parallel machines problem with job delivery coordination and availability constraint (Q256680) (← links)
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
- Optimal single machine scheduling of products with components and changeover cost (Q297186) (← links)
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
- Book review of: A. Agnetis et al., Multiagent scheduling. Models and algorithms (Q319704) (← links)
- Integrated production and delivery on parallel batching machines (Q320081) (← links)
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637) (← links)
- The lockmaster's problem (Q322695) (← links)
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- Batching scheduling in a two-level supply chain with earliness and tardiness penalties (Q328087) (← 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)
- Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing (Q342170) (← links)
- Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) (Q363579) (← links)
- An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← 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)
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination (Q387811) (← links)
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- Batch sequencing and cooperation (Q398862) (← links)
- A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (Q398896) (← links)
- Aircraft landing problems with aircraft classes (Q398897) (← links)
- Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
- Lot scheduling on a single machine (Q402382) (← links)
- Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) (← links)
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (Q435728) (← links)
- Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← links)
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs (Q479220) (← links)
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence (Q490158) (← links)
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness (Q547127) (← links)
- Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption (Q552458) (← links)
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087) (← links)
- On-line machine scheduling with batch setups (Q604758) (← links)
- Unbounded batch scheduling with a common due window on a single machine (Q611087) (← links)
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time (Q613775) (← links)
- Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
- Evolutionary algorithms and dynamic programming (Q652137) (← links)
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness (Q690456) (← links)
- Sequencing and scheduling for filling lines in dairy production (Q691446) (← links)
- Batching decisions for assembly production systems (Q703918) (← links)
- Single machine group scheduling with resource dependent setup and processing times (Q707136) (← links)
- Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic (Q709121) (← links)
