Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
DOI10.1111/itor.12096zbMath1317.90182OpenAlexW1966458658MaRDI QIDQ5257894
Béla Vizvári, Sadegh Niroomand
Publication date: 24 June 2015
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12096
production schedulingsimulated annealingmathematical programmingvariable neighborhood searchcable industry
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Case-oriented studies in operations research (90B90)
Related Items (1)
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- An improved linearization technique for a class of quadratic 0-1 programming problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
- Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling
- Experimental analysis of simulated annealing based algorithms for the layout problem
- A tabu search algorithm for parallel machine total tardiness problem
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
- A survey of scheduling problems with setup times or costs
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
- A branch‐and‐bound algorithm for scheduling of new product development projects
- Scheduling
This page was built for publication: Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
