Pages that link to "Item:Q646664"
From MaRDI portal
The following pages link to Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664):
Displaying 21 items.
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness (Q613514) (← links)
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times (Q976475) (← links)
- Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times (Q1634027) (← links)
- Resource cost aware scheduling (Q1750475) (← links)
- Minimizing the total weighted flow time in a single machine with controllable processing times (Q1886005) (← links)
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Research on permutation flow shop scheduling problems with general position-dependent learning effects (Q2449372) (← links)
- Some results of the worst-case analysis for flow shop scheduling with a learning effect (Q2449373) (← links)
- Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
- Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs (Q2823723) (← links)
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy (Q4205229) (← links)
- Throughput optimization for the Robotic Cell Problem with Controllable Processing Times (Q4603940) (← links)
- (Q4793089) (← links)
- (Q4927593) (← links)
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint (Q5058932) (← links)
- Two-machine flow shop scheduling with convex resource consumption functions (Q6097489) (← links)