Pages that link to "Item:Q6136084"

The following pages link to A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084):

Displaying 9 items.

• An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem (Q398866) (← links)
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines (Q880513) (← links)
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem (Q1793464) (← links)
• Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
• A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines (Q2387307) (← links)
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
• A note on just-in-time scheduling on flow shop machines (Q2801107) (← links)
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)