Pages that link to "Item:Q4022932"
From MaRDI portal
The following pages link to Batching and Scheduling Jobs on Batch and Discrete Processors (Q4022932):
Displaying 13 items.
- SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK (Q4921478) (← 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)
- Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423) (← links)
- Learning effective dispatching rules for batch processor scheduling (Q5385460) (← links)
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes (Q5478853) (← links)
- Scheduling a proportionate flow shop of batching machines (Q5919041) (← links)
- Machine scheduling with transportation considerations (Q5932281) (← links)
- Scheduling batches with simultaneous job processing for two-machine shop problems (Q5932282) (← links)
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date (Q5937351) (← links)
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan (Q5939968) (← links)
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed (Q5952788) (← links)
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure (Q5959373) (← links)