Pages that link to "Item:Q1969826"
From MaRDI portal
The following pages link to Scheduling with batching: A review (Q1969826):
Displayed 40 items.
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective (Q3156721) (← links)
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES (Q3421855) (← links)
- Scheduling Bidirectional Traffic on a Path (Q3448803) (← links)
- Decision making algorithm for a class of two‐level manufacturing systems (Q3451519) (← links)
- Lot-Sizing and Sequencing on a Single Imperfect Machine (Q3627683) (← links)
- Scheduling multiple products on parallel machines with setup costs (Q3627937) (← links)
- Single-machine batch scheduling problem with job rejection and resource dependent processing times (Q4553872) (← links)
- Dynamic scheduling of batch servers with compatible product families (Q4666778) (← links)
- Scheduling with product family set-up times: an application in TFT LCD manufacturing (Q4671319) (← links)
- Adaptive scheduling of batch servers in flow shops (Q4710093) (← links)
- Scheduling the production of rolling ingots: industrial context, model, and solution method (Q4814095) (← links)
- Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal (Q4905621) (← links)
- Analysis of batched service time data using Gaussian and semi-parametric kernel models (Q5036997) (← links)
- A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- Ship Traffic Optimization for the Kiel Canal (Q5126634) (← links)
- Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs (Q5174414) (← links)
- Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities (Q5270518) (← links)
- Transfer batch scheduling using genetic algorithms (Q5385427) (← links)
- Single machine group scheduling with family setups to minimize total tardiness (Q5385473) (← links)
- Cooperative driving at isolated intersections based on the optimal minimization of the maximum exit time (Q5409751) (← links)
- Influence of capacity- and time-constrained intermediate storage in two-stage food production systems (Q5426586) (← links)
- STOCHASTIC BATCH SCHEDULING AND THE “SMALLEST VARIANCE FIRST” RULE (Q5433639) (← links)
- Dynamic scheduling of batch-processing machines with non-identical product sizes (Q5438667) (← links)
- Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)
- Scheduling batches with simultaneous job processing for two-machine shop problems (Q5932282) (← links)
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan (Q5939968) (← links)
- A note on the complexity of family scheduling to minimize the number of late jobs (Q5946721) (← links)
- Single machine batch scheduling with resource dependent setup and processing times (Q5954835) (← links)
- Exact methods for the oven scheduling problem (Q6049438) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)
- Local search approaches for the test laboratory scheduling problem with variable task grouping (Q6090219) (← links)
- A hybrid neural network approach to minimize total completion time on a single batch processing machine (Q6092620) (← links)
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions (Q6112735) (← links)
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)
- Parallel batching with multi-size jobs and incompatible job families (Q6168657) (← links)
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161) (← links)