Pages that link to "Item:Q1000969"

The following pages link to Minimizing total tardiness on a single machine with controllable processing times (Q1000969):

Displaying 21 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)
• Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity (Q339549) (← links)
• Adaptive online scheduling of tasks with anytime property on heterogeneous resources (Q342556) (← links)
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness (Q613514) (← links)
• Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
• A metric for total tardiness minimization (Q2362385) (← links)
• Single-machine scheduling with time-and-resource-dependent processing times (Q2428936) (← links)
• Minimizing the earliness--tardiness costs on a single machine (Q2499156) (← links)
• Optimizing makespan and stability risks in job shop scheduling (Q2664315) (← links)
• Minimizing the Range of Lateness on a Single Machine (Q3330959) (← links)
• Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times (Q3455877) (← links)
• Minimizing the sum of job earliness and tardiness in a multimachine system (Q4245597) (← links)
• MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING (Q4345050) (← links)