Sequencing of jobs in some production system
From MaRDI portal
Publication:1582040
DOI10.1016/S0377-2217(99)00224-6zbMath0967.90045MaRDI QIDQ1582040
Jozef Grabowski, Jaroslaw Pempera
Publication date: 3 September 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
tabu search; approximation algorithm; hybrid flow shop scheduling; building industry; scheduling clients orders
90B40: Search theory
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90B30: Production models
Related Items
Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm, Machine scheduling in underground mining: an application in the potash industry, Optimizing blocking flow shop scheduling problem with total completion time criterion, A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking, A new neighborhood and tabu search for the blocking job shop, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems, Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems, Approximative procedures for no-wait job shop scheduling., Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion, On the exact solution of the no-wait flow shop problem with due date constraints, A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion, Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems, A three-phase algorithm for flowshop scheduling with blocking to minimize makespan, A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints, A heuristic to schedule flexible job-shop in a glass factory, A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time, Mathematical model and optimization in production investment., The hybrid flow shop scheduling problem, Metaheuristic algorithms for the hybrid flowshop scheduling problem, Some local search algorithms for no-wait flow-shop problem with makespan criterion, No-wait job shop scheduling: tabu search and complexity of subproblems, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem, An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops, An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach, Optimization in production quota problem with convex cost function, Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems, A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS, A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD
Cites Work
- Unnamed Item
- Unnamed Item
- Some efficient heuristic methods for the flow shop sequencing problem
- A block approach for single-machine scheduling with release dates and due dates
- A new heuristic method for the flow shop sequencing problem
- A fast tabu search algorithm for the permutation flow-shop problem
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Tabu Search—Part I
- Tabu Search—Part II
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
