Pages that link to "Item:Q1208482"

The following pages link to Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482):

Displayed 15 items.

• Two-machine flowshop scheduling with availability constraints (Q1296377) ‎ (← links)
• A new tabu search procedure for an audit-scheduling problem (Q1297694) ‎ (← links)
• Minimizing the sum of job completion times on capacitated parallel machines (Q1339850) ‎ (← links)
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517) ‎ (← links)
• Rescheduling of identical parallel machines under machine eligibility constraints. (Q1399598) ‎ (← links)
• Machine scheduling with a rate-modifying activity (Q1592740) ‎ (← links)
• Match-up scheduling under a machine breakdown (Q1806884) ‎ (← links)
• Single-machine scheduling with periodic maintenance and nonresumable jobs. (Q1868816) ‎ (← links)
• Makespan minimization for two parallel machines with an availability constraint (Q1887910) ‎ (← links)
• Scheduling with limited machine availability (Q1969884) ‎ (← links)
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641) ‎ (← links)
• Min-Max partitioning problem with matroid constraint (Q2519447) ‎ (← links)
• Machine scheduling with an availability constraint (Q2564885) ‎ (← links)
• (Q4934199) ‎ (← links)
• Single-machine scheduling with maintenance and repair rate-modifying activities (Q5955079) ‎ (← links)