Browsing by Author "Gupta, Jatinder N. D."

Now showing 1 - 2 of 2

Robust scheduling for a two-stage assembly shop with scenario-dependent processing times
(1970-01-01)
Wu, Chin-Chia
;
Gupta, Jatinder N. D.
;
Cheng, Shuenn-Ren
;
Lin, Bertrand M. T.
;
Yip, Siu-Hung
Recently, finding solutions to assembly flowshop scheduling problems is a topic of extensive discussion in research communities. While existing research assumes that job processing times are constant numbers, in several practical situations, due to several external factors like machine breakdowns, working environment changes, worker performance instabilities, and tool quality variations and unavailability, job processing times may vary. In this study, therefore, we address a two-stage assembly flowshop scheduling problem with two scenario-dependent jobs processing times to minimise the maximum makepsan among both scenarios (called robust makespan) In view of the NP-hard nature, we first derive a dominance property and a lower bound to propose a branch-and-bound algorithm to find a permutation schedule with minimum makespan. Following that, we use Johnson's rule to propose eight polynomial heuristics for finding near-optimal solutions. Furthermore, we propose four cloud theory-based simulated annealing (CSA) hyper-heuristic algorithms incorporating seven low level heuristics to solve a robust two-stage assembly flowshop problem with scenario-dependent processing times. Finally, we empirically evaluate the effectiveness of all the proposed algorithms in minimising the robust makespan.
Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
(2017-06-01)
Lin, Bertrand M. T.
;
Hwang, F. J.
;
Gupta, Jatinder N. D.
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Information Management and Finance
This paper studies the problem of scheduling three-operation jobs in a two-machine flowshop subject to a predetermined job processing sequence. Each job has two preassigned operations, which are to be performed on their respective dedicated machines, and a flexible operation, which may be processed on either of the two machines subject to the processing order as specified. Five standard objective functions, including the makespan, the maximum lateness, the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs are considered. We show that the studied problem for either of the five considered objective functions is ordinary NP-hard, even if the processing times of the preassigned operations are zero for all jobs. A pseudo-polynomial time dynamic programming framework, coupled with brief numerical experiments, is then developed for all the addressed performance metrics with different run times.