Pages that link to "Item:Q1807948"
From MaRDI portal
The following pages link to Deterministic job-shop scheduling: Past, present and future (Q1807948):
Displaying 48 items.
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems (Q1954823) (← links)
- Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem (Q2031353) (← links)
- Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems (Q2156606) (← links)
- Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
- Aggregation in job scheduling in machine works (Q2263860) (← links)
- Machine scheduling in production: a content analysis (Q2294174) (← links)
- A constraint programming method for advanced planning and scheduling system with multilevel structured products (Q2321546) (← links)
- Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach (Q2356184) (← links)
- A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Scheduling with timed automata (Q2368955) (← links)
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem (Q2378080) (← links)
- A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
- Optimization of logistic systems using fuzzy weighted aggregation (Q2455538) (← links)
- Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- Multicriteria optimisation and simulation: an industrial application (Q2468761) (← links)
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem (Q2471233) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- A hybrid genetic algorithm for the job shop scheduling problem (Q2484343) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Job-shop local-search move evaluation without direct consideration of the criterion's value (Q2629670) (← links)
- Optimizing makespan and stability risks in job shop scheduling (Q2664315) (← links)
- Extending the single machine-based relaxation scheme for the job shop scheduling problem (Q2861532) (← links)
- Multi-agent based beam search for intelligent production planning and scheduling (Q3163302) (← links)
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem (Q3498886) (← links)
- Multiple colony ant algorithm for job-shop scheduling problem (Q3518511) (← links)
- Job shop scheduling optimization through multiple independent particle swarms (Q3639476) (← links)
- A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling (Q4814097) (← links)
- A machine-order search space for job-shop scheduling problems (Q4814098) (← links)
- A Taxonomy for the Flexible Job Shop Scheduling Problem (Q5270504) (← links)
- Job-Shop Scheduling with Mixed Blocking Constraints between Operations (Q5357765) (← 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)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)
- An effective hybrid optimization strategy for job-shop scheduling problems (Q5936137) (← links)
- A deep multi-agent reinforcement learning approach to solve dynamic job shop scheduling problem (Q6047835) (← links)
- Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule (Q6048122) (← links)
- Resource-constrained multi-project scheduling problem: a survey (Q6112820) (← links)
- Application of quantum approximate optimization algorithm to job shop scheduling problem (Q6113354) (← links)
- Two-machine job-shop scheduling with one joint job (Q6153460) (← links)
- Monte Carlo tree search for priced timed automata (Q6160783) (← links)
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem (Q6164353) (← links)
- Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns (Q6588509) (← links)
- Propagation and branching strategies for job shop scheduling minimizing the weighted energy consumption (Q6606604) (← links)