Pages that link to "Item:Q1341994"
From MaRDI portal
The following pages link to Adjustment of heads and tails for the job-shop problem (Q1341994):
Displaying 50 items.
- Resource leveling in a machine environment (Q418090) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- Improving the preemptive bound for the single machine dynamic maximum lateness problem (Q614050) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
- Local adjustments: A general algorithm (Q707084) (← links)
- Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities (Q850453) (← links)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246) (← links)
- Arc-B-consistency of the inter-distance constraint (Q879973) (← links)
- New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
- A constraint programming approach for the resource-constrained project scheduling problem (Q940840) (← links)
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
- A heuristic for scheduling general job shops to minimize maximum lateness (Q969764) (← links)
- Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- An efficient algorithm for the job-shop problem with two jobs (Q1108919) (← links)
- Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality (Q1347601) (← links)
- Constraint-directed techniques for scheduling alternative activities (Q1583239) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- The disjunctive graph machine representation of the job shop scheduling problem (Q1590037) (← links)
- On not-first/not-last conditions in disjunctive scheduling (Q1590039) (← links)
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
- Local search with constraint propagation and conflict-based heuristics (Q1606115) (← links)
- A tabu search approach to machine scheduling (Q1609892) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
- A competent memetic algorithm for complex scheduling (Q1761722) (← links)
- Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage (Q1762032) (← links)
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem (Q1762094) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
- Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)
- An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136) (← links)
- Neighborhood singleton consistencies (Q2331105) (← links)
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
- A quadratic edge-finding filtering algorithm for cumulative resource constraints (Q2342594) (← links)
- A branch and bound algorithm for scheduling trains in a railway network (Q2371354) (← links)
- Strong polynomiality of resource constraint propagation (Q2427690) (← links)
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
