We formulate a general sequencing problem that includes two classes of jobs with setup times, setup costs, holding costs, and deadlines. The formulation is unique in its explicit recognition of the opportunities to exploit productive capacity increases due to batching. An algorithm based on tabu search is then used as a solution method. Computational results are presented that suggest that the algorithm is effective. (SEQUENCING, TABU SEARCH) 1
The problem is represented mathematically as a new mixed integer linear programming (MILP) model. Ex...
In this research, a single batch machine scheduling problem with sequence dependent setup time is st...
Advisors: Purushothaman Damodaran.Committee members: Omar Ghrayeb; Murali Krishnamurthi.Includes bib...
This paper proposes a hybrid tabu search (HTS) to minimise the total weighted tardiness (TWT) for th...
This paper addresses a cutting stock problem under typical resource constraints that arise when work...
In this paper we present a tabu search approach for a single-machine batching problem. A set of jobs...
The discrete lotsizing and scheduling problem for one machine with sequence dependent setup times an...
This paper addresses the problem of scheduling jobs with multi batches. Multi-Item Batch Scheduling...
The present work considers the reduction of the mean completion time and the makespan in the single ...
[[abstract]]This study considers production planning problems involving multiple products, multiple ...
In this paper, we discuss the “batch processing” problem, where there are multiple jobs to be proces...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
The efficient allocation of jobs to grid resources is indispensable for high performance grid-based ...
Advisors: Purushothaman Damodaran.Committee members: Murali Krishnamurthi; Christine Nguyen; Ziteng ...
This paper develops a two-phase tabu search-based methodology for detailed resource planning in make...
The problem is represented mathematically as a new mixed integer linear programming (MILP) model. Ex...
In this research, a single batch machine scheduling problem with sequence dependent setup time is st...
Advisors: Purushothaman Damodaran.Committee members: Omar Ghrayeb; Murali Krishnamurthi.Includes bib...
This paper proposes a hybrid tabu search (HTS) to minimise the total weighted tardiness (TWT) for th...
This paper addresses a cutting stock problem under typical resource constraints that arise when work...
In this paper we present a tabu search approach for a single-machine batching problem. A set of jobs...
The discrete lotsizing and scheduling problem for one machine with sequence dependent setup times an...
This paper addresses the problem of scheduling jobs with multi batches. Multi-Item Batch Scheduling...
The present work considers the reduction of the mean completion time and the makespan in the single ...
[[abstract]]This study considers production planning problems involving multiple products, multiple ...
In this paper, we discuss the “batch processing” problem, where there are multiple jobs to be proces...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
The efficient allocation of jobs to grid resources is indispensable for high performance grid-based ...
Advisors: Purushothaman Damodaran.Committee members: Murali Krishnamurthi; Christine Nguyen; Ziteng ...
This paper develops a two-phase tabu search-based methodology for detailed resource planning in make...
The problem is represented mathematically as a new mixed integer linear programming (MILP) model. Ex...
In this research, a single batch machine scheduling problem with sequence dependent setup time is st...
Advisors: Purushothaman Damodaran.Committee members: Omar Ghrayeb; Murali Krishnamurthi.Includes bib...