Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry (Q5257894): Difference between revisions

Latest revision as of 09:23, 10 July 2024

scientific article; zbMATH DE number 6449945

Language	Label	Description	Also known as
English	Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry	scientific article; zbMATH DE number 6449945

Statements

instance of

scholarly article

0 references

title

Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry (English)

0 references

0 references

0 references

International Transactions in Operational Research

0 references

publication date

24 June 2015

0 references

zbMATH Keywords

cable industry

0 references

mathematical programming

0 references

production scheduling

0 references

simulated annealing

0 references

variable neighborhood search

0 references

describes a project that uses

XPRESS

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1111/itor.12096

0 references

cites work

A survey of scheduling problems with setup times or costs

0 references

A tabu search algorithm for parallel machine total tardiness problem

0 references

A new linearization technique for multi-quadratic 0-1 programming problems.

0 references

A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines

0 references

Mixed integer linear programming in process scheduling: modeling, algorithms, and applications

0 references

An improved linearization technique for a class of quadratic 0-1 programming problems

0 references

Experimental analysis of simulated annealing based algorithms for the layout problem

0 references

Optimization by Simulated Annealing

0 references

Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling

0 references

Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

0 references

A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability

0 references

Scheduling

0 references

A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time

0 references

A branch‐and‐bound algorithm for scheduling of new product development projects

0 references

Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry

0 references

Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard

0 references

A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective

0 references

Identifiers

zbMATH Open document ID

1317.90182

0 references

DOI

10.1111/itor.12096

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5257894

@@ Property / describes a project that uses @@
+XPRESS
@@ Property / describes a project that uses: XPRESS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1111/itor.12096
+Normal rank
@@ Property / OpenAlex ID @@
+W1966458658
@@ Property / OpenAlex ID: W1966458658 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of scheduling problems with setup times or costs
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for parallel machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+A new linearization technique for multi-quadratic 0-1 programming problems.
+Normal rank
@@ Property / cites work @@
+A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
+Normal rank
@@ Property / cites work @@
+Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
+Normal rank
@@ Property / cites work @@
+An improved linearization technique for a class of quadratic 0-1 programming problems
+Normal rank
@@ Property / cites work @@
+Experimental analysis of simulated annealing based algorithms for the layout problem
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling
+Normal rank
@@ Property / cites work @@
+Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
+Normal rank
@@ Property / cites work @@
+Scheduling
@@ Property / cites work: Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
+Normal rank
@@ Property / cites work @@
+A branch‐and‐bound algorithm for scheduling of new product development projects
+Normal rank
@@ Property / cites work @@
+Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
+Normal rank
@@ Property / cites work @@
+A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
+Normal rank