Pages that link to "Item:Q1373460"
From MaRDI portal
The following pages link to Single machine scheduling with discretely controllable processing times (Q1373460):
Displaying 30 items.
- A decomposition approach to job-shop scheduling problem with discretely controllable processing times (Q412943) (← 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 resource dependent release times and processing times (Q704120) (← links)
- Single machine group scheduling with resource dependent setup and processing times (Q707136) (← links)
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
- Considering manufacturing cost and scheduling performance on a CNC turning machine (Q856225) (← links)
- Single machine scheduling problem with controllable processing times and resource dependent release times (Q877039) (← links)
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times (Q976475) (← links)
- Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
- Single-machine sequencing with controllable processing times (Q1194768) (← links)
- Single machine scheduling with a variable common due date and resource-dependent processing times. (Q1413814) (← links)
- Single machine batch scheduling with jointly compressible setup and processing times. (Q1417506) (← links)
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time (Q1772970) (← links)
- Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
- Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← 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 controllable release and processing parameters (Q2433805) (← links)
- Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
- SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN (Q3052719) (← links)
- A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
- (Q4793089) (← links)
- (Q4927593) (← links)
- A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (Q5949906) (← links)
- Single machine batch scheduling with resource dependent setup and processing times (Q5954835) (← links)
- Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times (Q6042072) (← links)