Pages that link to "Item:Q1040986"

The following pages link to Scheduling three chains on two parallel machines (Q1040986):

Displaying 11 items.

• A job-shop problem with one additional resource type (Q640303) (← links)
• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856) (← links)
• Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan (Q721932) (← links)
• Task splitting for three machine preemptive scheduling (Q1177707) (← links)
• Scheduling multiprocessor tasks with chain constraints (Q1278298) (← links)
• Scheduling on parallel machines with preemption and transportation delays (Q1761986) (← links)
• Scheduling chain-structured tasks to minimize makespan and mean flow time (Q1814098) (← links)
• Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
• Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211) (← links)
• The composition chain algorithm and a class of single batch machine scheduling problems with chain precedence constraints (Q2860356) (← links)
• (Q3610745) (← links)