Pages that link to "Item:Q992578"

The following pages link to Scheduling multiple orders per job in a single machine to minimize total completion time (Q992578):

Displaying 12 items.

• Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems (Q256691) (← links)
• Sequence-dependent scheduling with order deliveries (Q907392) (← links)
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
• Order acceptance and due-date quotation in low machine rates (Q1630128) (← links)
• A note on a single-machine lot scheduling problem with indivisible orders (Q1652143) (← links)
• A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times (Q1762129) (← links)
• Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties (Q2029905) (← links)
• Customer order scheduling to minimize the number of late jobs (Q2371386) (← links)
• (Q2993028) (← links)
• Minimizing the Range of Order Completion Times with Multiple Job Classes (Q4273304) (← links)
• Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date (Q4634328) (← links)
• (Q4640465) (← links)