The problem is represented mathematically as a new mixed integer linear programming (MILP) model. Extensive work has been carried out to investigate the capability of the MILP model in providing optimal solutions to small size problems which consist of 4 and 6 jobs per family with 2 and 3 families for a total of 640 problem instances. However, the MILP cannot produce optimal solutions for the problem of 8 jobs per family, 3 families and batch size 2. As the author recognises the limitations of the MILP model in solving large problems, the crucial need arises in finding other solution methods for the research problem
A hybrid Mixed-Integer Linear Programming/Constraint Programming (MILP/CP) decomposition algorithm f...
Graduation date: 2018In this research, a bi-criteria batching and scheduling problem is investigated...
A single machine batch processing problem with release dates to minimize the total completion time (...
This paper proposes a hybrid tabu search (HTS) to minimise the total weighted tardiness (TWT) for th...
[[abstract]]This study considers production planning problems involving multiple products, multiple ...
In this paper we present a tabu search approach for a single-machine batching problem. A set of jobs...
Abstract This paper introduces tabu search for the solution of general linear integer prob-lems. Sea...
The scheduling departments of batch manufacturing plants have to repeatedly solve a complex scheduli...
We formulate a general sequencing problem that includes two classes of jobs with setup times, setup ...
We present a computational study of parametric tabu search for solving 01 mixed integer programming ...
Abstract: "This paper provides a general overview of mixed- integer optimization techniques that are...
The branch and bound procedure for solving mixed integer programming (MIP) problems using linear pro...
A generalization on the tabu search method, recently developed for combinatorial optimization proble...
A generalization on the tabu search method, recently developed for combinatorial optimization proble...
Abstract:- Decision making for complex systems is based on multi-criterion-optimization. A decision ...
A hybrid Mixed-Integer Linear Programming/Constraint Programming (MILP/CP) decomposition algorithm f...
Graduation date: 2018In this research, a bi-criteria batching and scheduling problem is investigated...
A single machine batch processing problem with release dates to minimize the total completion time (...
This paper proposes a hybrid tabu search (HTS) to minimise the total weighted tardiness (TWT) for th...
[[abstract]]This study considers production planning problems involving multiple products, multiple ...
In this paper we present a tabu search approach for a single-machine batching problem. A set of jobs...
Abstract This paper introduces tabu search for the solution of general linear integer prob-lems. Sea...
The scheduling departments of batch manufacturing plants have to repeatedly solve a complex scheduli...
We formulate a general sequencing problem that includes two classes of jobs with setup times, setup ...
We present a computational study of parametric tabu search for solving 01 mixed integer programming ...
Abstract: "This paper provides a general overview of mixed- integer optimization techniques that are...
The branch and bound procedure for solving mixed integer programming (MIP) problems using linear pro...
A generalization on the tabu search method, recently developed for combinatorial optimization proble...
A generalization on the tabu search method, recently developed for combinatorial optimization proble...
Abstract:- Decision making for complex systems is based on multi-criterion-optimization. A decision ...
A hybrid Mixed-Integer Linear Programming/Constraint Programming (MILP/CP) decomposition algorithm f...
Graduation date: 2018In this research, a bi-criteria batching and scheduling problem is investigated...
A single machine batch processing problem with release dates to minimize the total completion time (...
Add to ORKG