Pages that link to "Item:Q1077325"

The following pages link to Efficient scheduling algorithms for a single batch processing machine (Q1077325):

Displaying 36 items.

• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519) (← links)
• On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines (Q2486757) (← links)
• On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2574421) (← links)
• Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
• Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
• A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
• Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
• Minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2741217) (← links)
• Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices (Q2954338) (← links)
• Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity (Q2988826) (← links)
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes (Q3055315) (← links)
• (Q3405068) (← 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)
• Scheduling batch processing machines with incompatible job families (Q4399080) (← links)
• The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs (Q4632193) (← links)
• Dynamic scheduling of batch servers with compatible product families (Q4666778) (← links)
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312) (← links)
• Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm (Q4972548) (← links)
• Integrated scheduling on parallel batch processing machines with non-identical capacities (Q5059346) (← links)
• Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
• A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan (Q5244301) (← links)
• Learning effective dispatching rules for batch processor scheduling (Q5385460) (← links)
• A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately (Q5436247) (← links)
• Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching (Q5438632) (← links)
• Dynamic scheduling of batch-processing machines with non-identical product sizes (Q5438667) (← 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)
• Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date (Q5937351) (← 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)
• A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694) (← links)
• Parallel batching with multi-size jobs and incompatible job families (Q6168657) (← links)
• Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm (Q6551161) (← links)