Pages that link to "Item:Q4645937"
From MaRDI portal
The following pages link to A new approach to computing optimal schedules for the job-shop scheduling problem (Q4645937):
Displaying 45 items.
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce (Q282236) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- Resource leveling in a machine environment (Q418090) (← links)
- An optimal method for the preemptive job shop scheduling problem (Q502444) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- Local adjustments: A general algorithm (Q707084) (← links)
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- A practical use of Jackson's preemptive schedule for solving the job shop problem (Q922282) (← links)
- A filter-and-fan approach to the job shop scheduling problem (Q958547) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← 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)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
- A permutation-based approach for solving the job-shop problem (Q1370981) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- On not-first/not-last conditions in disjunctive scheduling (Q1590039) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems (Q1718781) (← links)
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem (Q1723298) (← links)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← 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 exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective (Q2027031) (← links)
- Neighborhood singleton consistencies (Q2331105) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- A linear programming-based method for job shop scheduling (Q2434310) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
- (Q2932933) (← links)
- (Q3096309) (← links)
- (Q3416604) (← links)
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective (Q3637390) (← links)
- An Algorithm for Solving the Job-Shop Problem (Q3833853) (← links)
- A Computational Study of the Job-Shop Scheduling Problem (Q4025904) (← links)
- Improving job-shop schedules through critical pairwise exchanges (Q4245535) (← links)
- Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351) (← links)
- (Q4782910) (← links)
- Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties (Q5242361) (← links)
- (Q5692629) (← links)
- Constraint reasoning (Q6602253) (← links)