Pages that link to "Item:Q5328566"

The following pages link to A Geometric Model and a Graphical Algorithm for a Sequencing Problem (Q5328566):

Displaying 17 items.

• Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
• Scheduling co-operating stacking cranes with predetermined container sequences (Q908295) (← links)
• An efficient algorithm for the job-shop problem with two jobs (Q1108919) (← links)
• Job-shop scheduling with multi-purpose machines (Q1174353) (← links)
• The complexity of shop-scheduling problems with two or three jobs (Q1178530) (← links)
• Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function (Q1310024) (← links)
• Scheduling two jobs with fixed and nonfixed routes (Q1316587) (← links)
• The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331) (← links)
• Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• NP-hardness of shop-scheduling problems with three jobs (Q1893158) (← links)
• Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
• Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
• A new lower bound for the job-shop scheduling problem (Q2366077) (← links)
• Parameterized mixed graph coloring (Q2424815) (← links)
• Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) (← links)