Pages that link to "Item:Q1582040"
From MaRDI portal
The following pages link to Sequencing of jobs in some production system (Q1582040):
Displayed 17 items.
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122) (← links)
- A new neighborhood and tabu search for the blocking job shop (Q967433) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems (Q1038288) (← links)
- Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
- A heuristic to schedule flexible job-shop in a glass factory (Q1772853) (← links)
- Mathematical model and optimization in production investment. (Q1855750) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- Optimization in production quota problem with convex cost function (Q2497848) (← links)
- A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD (Q3406729) (← links)