Pages that link to "Item:Q1310019"
From MaRDI portal
The following pages link to Two parallel machine sequencing problems involving controllable job processing times (Q1310019):
Displaying 41 items.
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
- Single machine scheduling with resource dependent release times and processing times (Q704120) (← links)
- Sequencing games with controllable processing times (Q818079) (← links)
- Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
- Scheduling parallel CNC machines with time/cost trade-off considerations (Q875425) (← links)
- A survey of results for sequencing problems with controllable processing times (Q908846) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← 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)
- Single-machine scheduling with learning considerations (Q1124688) (← links)
- Single-machine sequencing with controllable processing times (Q1194768) (← links)
- Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. (Q1413824) (← links)
- Some comments on sequencing with controllable processing times (Q1599819) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Minimizing completion time variance with compressible processing times (Q1781972) (← links)
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times (Q1917233) (← links)
- Scheduling a batching machine with convex resource consumption functions (Q1944176) (← links)
- Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
- Single machine scheduling with common due date and controllable processing times (Q2489364) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- A controlable two-machine flowshop scheduling problem (Q2916936) (← links)
- OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES (Q2931728) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- Scheduling with controllable processing times and compression costs using population-based heuristics (Q3168916) (← links)
- Single–machine scheduling with random machine breakdowns and randomly compressible processing times (Q4495504) (← links)
- A makespan minimization problem for versatile developers in the game industry (Q6186551) (← links)
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs (Q6565429) (← links)
