Pages that link to "Item:Q1194768"
From MaRDI portal
The following pages link to Single-machine sequencing with controllable processing times (Q1194768):
Displaying 36 items.
- Single machine scheduling with resource dependent release times and processing times (Q704120) (← links)
- Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← links)
- Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
- Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
- Two due date assignment problems in scheduling a single machine (Q867932) (← links)
- Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← 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)
- Optimal control of production processes with variable execution times (Q977002) (← links)
- Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
- Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
- Single-machine scheduling with learning considerations (Q1124688) (← links)
- A fuzzy-linguistic approach to a multi-criteria sequencing problem (Q1268297) (← links)
- Scheduling under a common due-date on parallel unrelated machines (Q1291766) (← links)
- Two parallel machine sequencing problems involving controllable job processing times (Q1310019) (← links)
- Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
- Minimizing completion time variance with compressible processing times (Q1781972) (← links)
- Effects of OCRA parameters and learning rate on machine scheduling (Q2155133) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- Single-machine scheduling with time-and-resource-dependent processing times (Q2428936) (← links)
- Scheduling with controllable release dates and processing times: total completion time minimization (Q2433441) (← links)
- Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
- Optimal due-date assignment problem with learning effect and resource-dependent processing times (Q2439495) (← links)
- Single machine scheduling with common due date and controllable processing times (Q2489364) (← links)
- Single machine common flow allowance scheduling with controllable processing times (Q2504094) (← links)
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times (Q2566700) (← links)
- Scheduling with controllable processing times and compression costs using population-based heuristics (Q3168916) (← links)
- Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times (Q3455877) (← links)
- Single CNC machine scheduling with controllable processing times and multiple due dates (Q3605428) (← links)
- Single–machine scheduling with random machine breakdowns and randomly compressible processing times (Q4495504) (← links)
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE (Q4649880) (← links)
- A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)
