Pages that link to "Item:Q4443085"
From MaRDI portal
The following pages link to Makespan Minimization in Job Shops: A Linear Time Approximation Scheme (Q4443085):
Displaying 12 items.
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- Approximations for the two-machine cross-docking flow shop problem (Q2446855) (← links)
- Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (Q3196375) (← links)
- APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS (Q5187850) (← links)
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660) (← links)
