Pages that link to "Item:Q319146"

The following pages link to Total completion time minimization on multiple machines subject to machine availability and makespan constraints (Q319146):

Displaying 9 items.

• Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
• Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (Q631768) (← links)
• Scheduling with time-of-use costs (Q1755384) (← links)
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints (Q1887763) (← links)
• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
• Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115) (← links)
• A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
• Makespan Minimization with Machine Availability Constraints (Q3637090) (← links)
• Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions (Q6112735) (← links)