Pages that link to "Item:Q4301287"
From MaRDI portal
The following pages link to Scheduling Multiple Variable-Speed Machines (Q4301287):
Displayed 26 items.
- A survey on offline scheduling with rejection (Q398830) (← links)
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
- Scheduling with tool changes to minimize total completion time under controllable machining conditions (Q868153) (← 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)
- 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)
- An approximation algorithm for the generalized assignment problem (Q1319018) (← links)
- Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
- Optimal makespan scheduling with given bounds of processing times (Q1381777) (← links)
- Machine scheduling with a rate-modifying activity (Q1592740) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← 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)
- Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach (Q2371348) (← 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)
- Heuristic for a new multiobjective scheduling problem (Q2463826) (← links)
- Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times (Q2566700) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- Heuristics for determining economic processing rates in a flexible manufacturing system (Q5925940) (← links)
- Scheduling experiments on a nulear reactor using mixed integer programming (Q5945333) (← links)
- A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (Q5949906) (← links)