Pages that link to "Item:Q3904361"
From MaRDI portal
The following pages link to Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops (Q3904361):
Displaying 31 items.
- Scheduling ordered open shops (Q580167) (← links)
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- Branch and bound algorithm for the flow shop with multiple processors (Q809880) (← links)
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
- On the complexity of preemptive open-shop scheduling problems (Q1058969) (← links)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints (Q1136220) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- One machine scheduling problem with fuzzy duedates (Q1342032) (← links)
- Open shop problem with zero-one time operations and integer release date/deadline intervals (Q1363753) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Open shop scheduling problems with late work criteria. (Q1421458) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- A tabu search approach to machine scheduling (Q1609892) (← links)
- Conditions for the existence of continuous schedules of duration five (Q1759070) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows (Q2378457) (← links)
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223) (← links)
- Comparative approaches to equipment scheduling in high volume factories (Q2565775) (← links)
- (Q3085447) (← links)
- Some new results in flow shop scheduling (Q3312010) (← links)
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715) (← links)
- Two-machine open shop scheduling with an availability constraint (Q5949921) (← links)
- A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks (Q6048111) (← links)
