Pages that link to "Item:Q975765"

The following pages link to Just-in-time scheduling with controllable processing times on parallel machines (Q975765):

Displaying 17 items.

• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
• Simultaneous job scheduling and resource allocation on parallel machines (Q596456) (← links)
• Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time (Q1761997) (← links)
• Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
• Single machine resource allocation scheduling problems with deterioration effect and general positional effect (Q1981261) (← links)
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
• Models and algorithms for energy-efficient scheduling with immediate start of jobs (Q2317131) (← links)
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
• Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)
• Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
• (Q3170676) (← links)
• On the parameterized complexity of interval scheduling with eligible machine sets (Q6564614) (← links)