Pages that link to "Item:Q2457273"

The following pages link to Approximation algorithms for UET scheduling problems with exact delays (Q2457273):

Displaying 17 items.

• A branch-and-bound algorithm for the coupled task problem (Q406642) (← links)
• Scheduling of coupled tasks with unit processing times (Q600841) (← links)
• Scheduling coupled-operation jobs with exact time-lags (Q714025) (← links)
• Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560) (← links)
• Minimizing total completion time in two-machine flow shops with exact delays (Q1000994) (← links)
• Improved analysis of an algorithm for the coupled task problem with UET jobs (Q1015304) (← links)
• A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays (Q2060394) (← links)
• Coupled task scheduling with time-dependent processing times (Q2061140) (← links)
• Approximating the 2-machine flow shop problem with exact delays taking two values (Q2174271) (← links)
• Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
• Two-machine flowshop scheduling problem with coupled-operations (Q2327688) (← links)
• Two machines flow shop with reentrance and exact time lag (Q2805477) (← links)
• A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays (Q5443372) (← links)
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays (Q5505680) (← links)
• A binary search algorithm for the general coupled task scheduling problem (Q6057721) (← links)
• Approximation algorithms for coupled task scheduling minimizing the sum of completion times (Q6179222) (← links)
• The coupled task scheduling problem: an improved mathematical program and a new solution algorithm (Q6195035) (← links)