Pages that link to "Item:Q2367392"

The following pages link to Minimizing total completion time on a batch processing machine with job families (Q2367392):

Displaying 50 items.

• Integrated production and delivery on parallel batching machines (Q320081) (← links)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679) (← links)
• Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
• On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556) (← links)
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint (Q850651) (← links)
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
• Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem (Q940867) (← links)
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
• Scheduling with agreeable release times and due dates on a batch processing machine (Q1278533) (← links)
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals (Q1348547) (← links)
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing (Q1579492) (← links)
• A PTAS for semiconductor burn-in scheduling (Q1774521) (← links)
• Minimizing due date related performance measures on two batch processing machines (Q1873010) (← links)
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
• Scheduling a batching machine with convex resource consumption functions (Q1944176) (← 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)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Mixed batch scheduling on identical machines (Q2197328) (← links)
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
• Minimizing total completion time on a batch processing machine with job families (Q2367392) (← links)
• MIP formulations and heuristics for solving parallel batching problems (Q2429916) (← links)
• Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
• Optimality conditions to the acyclic travelling salesman problem. (Q2467841) (← links)
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines (Q2486757) (← links)
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← 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)
• Minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2741217) (← links)
• Minimizing total completion time on a batching machine with job processing time compatibilities (Q2861568) (← links)
• Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries (Q2867109) (← links)
• ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING (Q3022023) (← links)
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292) (← links)
• Heuristic scheduling of jobs on a multi-product batch processing machine (Q4230214) (← links)
• Minimizing the Range of Order Completion Times with Multiple Job Classes (Q4273304) (← links)
• Scheduling a single batch processing machine with non-identical job sizes (Q4394297) (← links)
• Scheduling batch processing machines with incompatible job families (Q4399080) (← 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)
• Adaptive scheduling of batch servers in flow shops (Q4710093) (← links)
• Integrated scheduling on parallel batch processing machines with non-identical capacities (Q5059346) (← links)
• Learning effective dispatching rules for batch processor scheduling (Q5385460) (← 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)
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes (Q5478853) (← links)
• Scheduling batches with simultaneous job processing for two-machine shop problems (Q5932282) (← 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)