Pages that link to "Item:Q4022932"
From MaRDI portal
The following pages link to Batching and Scheduling Jobs on Batch and Discrete Processors (Q4022932):
Displayed 47 items.
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
- A hybrid two-stage transportation and batch scheduling problem (Q838180) (← links)
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (Q840154) (← links)
- A note on the complexity of flow shop scheduling with transportation constraints (Q859706) (← links)
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop (Q879285) (← links)
- Multiple orders per job batch scheduling with incompatible jobs (Q940891) (← links)
- The coordination of transportation and batching scheduling (Q965544) (← links)
- Scheduling with families of jobs and delivery coordination under job availability (Q1034606) (← links)
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times (Q1046715) (← links)
- Scheduling with agreeable release times and due dates on a batch processing machine (Q1278533) (← links)
- Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine (Q1290647) (← links)
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals (Q1348547) (← links)
- Scheduling job shops with batch machines using the Lagrangian relaxation technique (Q1383473) (← links)
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing (Q1579492) (← links)
- A new dynamic look-ahead scheduling procedure for batching machines (Q1600008) (← links)
- Two-machine flowshop batching and scheduling (Q1772969) (← links)
- On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) (← links)
- Minimizing due date related performance measures on two batch processing machines (Q1873010) (← links)
- Machine scheduling with job delivery coordination (Q1876146) (← links)
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
- Complexity of flow shop scheduling problems with transportation constraints (Q1887768) (← links)
- Earliness and tardiness scheduling problems on a batch processor (Q1961238) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines (Q1969905) (← links)
- Minimizing total completion time on a batch processing machine with job families (Q2367392) (← links)
- Minimizing makespan in a two-machine flowshop scheduling with batching and release time (Q2390059) (← links)
- MIP formulations and heuristics for solving parallel batching problems (Q2429916) (← links)
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines (Q2486757) (← links)
- A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM (Q3430322) (← links)
- A Two-Stage Flexible Flowshop Problem with Deterioration (Q3511377) (← links)
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines (Q3636744) (← links)
- Heuristic scheduling of jobs on a multi-product batch processing machine (Q4230214) (← links)
- Scheduling a single batch processing machine with non-identical job sizes (Q4394297) (← links)
- The use of upstream and downstream information in scheduling semiconductor batch operations (Q4399015) (← links)
- Scheduling batch processing machines with incompatible job families (Q4399080) (← links)
- Dynamic scheduling of batch servers with compatible product families (Q4666778) (← links)
- Integrated design approach for virtual production line-based reconfigurable manufacturing systems (Q4671293) (← links)
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312) (← links)
- Adaptive scheduling of batch servers in flow shops (Q4710093) (← 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)
- 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)