Pages that link to "Item:Q4467342"

The following pages link to Maximum weight<i>k</i>-independent set problem on permutation graphs (Q4467342):

Displaying 13 items.

• The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
• Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
• \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
• Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
• An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
• The exact weighted independent set problem in perfect graphs and related classes (Q2840556) (← links)
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
• MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS (Q4294716) (← links)
• “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)