Pages that link to "Item:Q4022932"

The following pages link to Batching and Scheduling Jobs on Batch and Discrete Processors (Q4022932):

Displaying 50 items.

• Approximation algorithms for the single-machine scheduling with a period of maintenance (Q279822) (← links)
• A constant-factor approximation algorithm for multi-vehicle collection for processing problem (Q376011) (← links)
• Heuristics for parallel machine scheduling with batch delivery consideration (Q380563) (← links)
• Batch sequencing and cooperation (Q398862) (← links)
• A two stage scheduling with transportation and batching (Q456105) (← links)
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
• Controlling job arrivals with processing time windows into batch processor buffer (Q763114) (← 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)
• Model approximation for batch flow shop scheduling with fixed batch sizes (Q896496) (← links)
• Multiple orders per job batch scheduling with incompatible jobs (Q940891) (← links)
• The coordination of transportation and batching scheduling (Q965544) (← links)
• Scheduling jobs on grid processors (Q973018) (← 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)
• Integrated production and transportation on parallel batch machines to minimize total weighted delivery time (Q1628115) (← links)
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
• Two-stage hybrid flow shop scheduling with dynamic job arrivals (Q1762160) (← 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)
• Integrated problem of soaking pit heating and hot rolling scheduling in steel plants (Q2003439) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← 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)
• Realistic two-stage flowshop batch scheduling problems with transportation capacity and times (Q2428924) (← links)
• MIP formulations and heuristics for solving parallel batching problems (Q2429916) (← links)
• Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903) (← links)
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines (Q2486757) (← links)
• Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries (Q2867109) (← links)
• Batch-size-based rearrangement of the shop floor into mini-lines (Q2967580) (← 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)
• (Q3641177) (← links)