Pages that link to "Item:Q3833853"
From MaRDI portal
The following pages link to An Algorithm for Solving the Job-Shop Problem (Q3833853):
Displayed 50 items.
- Dynamic resource allocation: a flexible and tractable modeling framework (Q299823) (← links)
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- An effective new island model genetic algorithm for job shop scheduling problem (Q342266) (← links)
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- Project scheduling with flexible resources: formulation and inequalities (Q443821) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms (Q630749) (← 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)
- A robust approach for the single machine scheduling problem (Q835547) (← links)
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- An effective architecture for learning and evolving flexible job-shop schedules (Q858446) (← links)
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246) (← links)
- New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement (Q900590) (← links)
- FMS scheduling based on timed Petri net model and reactive graph search (Q937986) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- A filter-and-fan approach to the job shop scheduling problem (Q958547) (← 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)
- Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← 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)
- One-machine rescheduling heuristics with efficiency and stability as criteria (Q1201849) (← links)
- Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
- Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- The generalized shifting bottleneck procedure (Q1268190) (← links)
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
- A branch and bound algorithm for the resource-constrained project scheduling problem (Q1296084) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- Benchmarks for shop scheduling problems (Q1296703) (← links)
- Analysis of the temporal decomposition procedure for scheduling with release and due dates (Q1303726) (← links)
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357) (← links)
- Cellular control of manufacturing systems (Q1309976) (← links)
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
- Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (Q1319564) (← links)
- A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
- The job-shop problem and immediate selection (Q1339120) (← links)