Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Goal Programming Approach For Bi-Objective Optimization For A Single Batch Processing Machine, Dheeban Kumar Srinivasan Sampathi
Goal Programming Approach For Bi-Objective Optimization For A Single Batch Processing Machine, Dheeban Kumar Srinivasan Sampathi
Graduate Research Theses & Dissertations
This research considers a real-time problem where jobs need to be batched and scheduled to a single batch processing machine to minimize makespan and maximum tardiness. Jobs must be placed in batches such that the machine capacity is not violated. The jobs considered have unequal ready times, unequal processing times, and unequal sizes. This research aims to develop an effective solution approach for the proposed problem. The problem under study can be denoted as 1|p-batch, sj, rj| Cmax, Tmax.
The problem under study is NP-Hard. A new Mixed Integer Linear Programming (MILP) formulation using Goal programming (MILP-G) and Column Generation …
Bi-Objective Optimization For A Single Batch Processing Machine, Leena Omar Ghrayeb
Bi-Objective Optimization For A Single Batch Processing Machine, Leena Omar Ghrayeb
Graduate Research Theses & Dissertations
This research proposes a methodology for solving the problem of scheduling jobs with unequal ready times, unequal processing times, and unequal sizes on a single batch processing machine, with the objectives of minimizing makespan and maximum tardiness. Jobs must be placed into batches and scheduled on the machine such that both objectives are minimized, and machine capacity is not violated. The problem under study can be denoted as 1|p-batch, sj, rj| Cmax,Tmax. Based on a review of relevant literature, this problem has not been considered before.
The problem under study is NP-hard. Consequently, meta-heuristics such as Simulated Annealing (SA) and …
Minimizing Total Number Of Tardy Jobs In Two-Stage Flow Shop Using Simulated Annealing And Column Generation, Shashwot Uprety
Minimizing Total Number Of Tardy Jobs In Two-Stage Flow Shop Using Simulated Annealing And Column Generation, Shashwot Uprety
Graduate Research Theses & Dissertations
This research considers a scheduling problem where jobs need to be grouped in batches and scheduled in a two-stage flow shop with batch processing machines. The jobs are batched in such a way that machine capacity is not violated. The batches are scheduled in such a way to reduce the total number of tardy jobs. The problem under study, denoted as F2 | Batch | ΣUi in scheduling literature, has received less attention. The problem under study is NP-hard. Consequently, commercial solvers used to solve mathematical formulations to find an optimal solution require prohibitively long run times.
In this thesis, …