Pages that link to "Item:Q4394297"

The following pages link to Scheduling a single batch processing machine with non-identical job sizes (Q4394297):

Displaying 50 items.

• A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
• Integrated production and delivery on parallel batching machines (Q320081) (← links)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679) (← links)
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes (Q336992) (← links)
• Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
• A particle swarm optimizer for grouping problems (Q497654) (← links)
• A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← 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)
• Minimizing makespan with multiple-orders-per-job in a two-machine flowshop (Q879285) (← links)
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (Q924888) (← links)
• Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem (Q940867) (← links)
• Multiple orders per job batch scheduling with incompatible jobs (Q940891) (← links)
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356) (← links)
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
• An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040) (← links)
• A note on minimizing makespan on a single batch processing machine with nonidentical job sizes (Q1029348) (← 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 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)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
• Integrated scheduling on a batch machine to minimize production, inventory and distribution costs (Q1698887) (← links)
• Scheduling batch processing machine using max-min ant system algorithm improved by a local search method (Q1720742) (← links)
• Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827) (← links)
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
• An optimization model for freight transport using urban rail transit (Q1754289) (← links)
• Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
• A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times (Q1762129) (← 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)
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines (Q1969905) (← links)
• Frameworks for adaptable scheduling algorithms (Q1976517) (← links)
• Grouping evolution strategies: an effective approach for grouping problems (Q2009978) (← links)
• Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration (Q2022187) (← links)
• Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs (Q2027084) (← links)
• Number of bins and maximum lateness minimization in two-dimensional bin packing (Q2029951) (← links)
• Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
• Column generation for minimizing total completion time in a parallel-batching environment (Q2066680) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance (Q2156319) (← links)
• Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
• Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine (Q2182772) (← links)