Pages that link to "Item:Q922282"
From MaRDI portal
The following pages link to A practical use of Jackson's preemptive schedule for solving the job shop problem (Q922282):
Displaying 50 items.
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) (← links)
- A job-shop problem with one additional resource type (Q640303) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
- Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results (Q814422) (← links)
- Exact method for the two-machine flow-shop problem with time delays (Q829189) (← links)
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search (Q846170) (← 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)
- Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
- Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
- Non-binary quantified CSP: Algorithms and modelling (Q1037645) (← links)
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134) (← links)
- Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling (Q1266543) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
- A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
- The job-shop problem and immediate selection (Q1339120) (← links)
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal (Q1339130) (← links)
- Adjustment of heads and tails for the job-shop problem (Q1341994) (← links)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
- Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- On not-first/not-last conditions in disjunctive scheduling (Q1590039) (← links)
- A new LP-based lower bound for the cumulative scheduling problem (Q1590042) (← 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)
- Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← 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)
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357) (← links)
- Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
- A hybrid genetic algorithm for the job shop scheduling problem (Q2484343) (← links)
- Sweep synchronization as a global propagation mechanism (Q2489125) (← links)
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
- Modeling with Metaconstraints and Semantic Typing of Variables (Q2806860) (← links)
- Immersed NURBS for CFD Applications (Q2948918) (← links)
- Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties (Q5242361) (← links)
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
