Pages that link to "Item:Q4152322"
From MaRDI portal
The following pages link to Job-Shop Scheduling by Implicit Enumeration (Q4152322):
Displayed 38 items.
- 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)
- Fuzzy job-shop scheduling problems: a review (Q506738) (← links)
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms (Q630749) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- A decomposition approach to multi-project scheduling (Q809877) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
- Scheduling of project networks (Q908839) (← links)
- Job oriented production scheduling (Q915631) (← links)
- FMS scheduling based on timed Petri net model and reactive graph search (Q937986) (← links)
- A heuristic for scheduling general job shops to minimize maximum lateness (Q969764) (← links)
- A mixed integer program for loading and scheduling multiple flexible manufacturing cells (Q1082246) (← links)
- An adaptive branching rule for the permutation flow-shop problem (Q1141078) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
- A neural network model for scheduling problems (Q1268160) (← 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)
- Job-shop scheduling with convex models of operations (Q1341401) (← links)
- Effective job shop scheduling through active chain manipulation (Q1342330) (← links)
- RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions. (Q1406711) (← links)
- Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
- A tabu search approach to machine scheduling (Q1609892) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Job-shop scheduling with resource-time models of operations (Q1820680) (← links)
- An improved shifting bottleneck procedure for the job shop scheduling problem (Q1879795) (← links)
- A hybrid genetic algorithm for the job shop scheduling problem (Q2484343) (← links)
- Immersed NURBS for CFD Applications (Q2948918) (← links)
- Multi-agent based beam search for intelligent production planning and scheduling (Q3163302) (← links)
- Scheduling larger job shops: a decomposition approach (Q4230201) (← links)
- (Q4238569) (← links)
- A dynamic job shop scheduling framework: a backward approach (Q4394248) (← links)
- A modified shifting bottleneck procedure for job-shop scheduling (Q4696979) (← links)
- Dynamical Neural Network Approach to the Job-shop Scheduling (Q4846554) (← links)
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
- Optimal scheduling for flexible job shop operation (Q5466730) (← links)
- An effective hybrid optimization strategy for job-shop scheduling problems (Q5936137) (← links)