Single machine scheduling for multi-assembly jobs with preemption

Single machine scheduling for multi-assembly jobs with preemption

© 2016 IEEE. This research proposes a mathematic model for scheduling multi-assembly jobs with uncertain arrival of raw materials or sub-assembly parts and allowable preemption, aiming to minimize tardiness penalty and set-up cost under a single machine. The experimental results show that using the...

Full description

Saved in:
Bibliographic Details
Main Authors: L. Boonma, R. Sirovetnukul, T. Sarttra
Other Authors: Mahidol University
Format: Conference or Workshop Item
Published: 2018
Subjects:
Business, Management and Accounting
Engineering
Online Access:https://repository.li.mahidol.ac.th/handle/123456789/43270
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Mahidol University
id th-mahidol.43270
record_format dspace
spelling th-mahidol.432702019-03-14T15:04:20Z Single machine scheduling for multi-assembly jobs with preemption L. Boonma R. Sirovetnukul T. Sarttra Mahidol University Business, Management and Accounting Engineering © 2016 IEEE. This research proposes a mathematic model for scheduling multi-assembly jobs with uncertain arrival of raw materials or sub-assembly parts and allowable preemption, aiming to minimize tardiness penalty and set-up cost under a single machine. The experimental results show that using the exact algorithm (Branch and Bound) in Lingo 12 is not capable of solve the large-sized problems. Balancing tardiness and set-up cost (BTS) algorithm, therefore, is developed and is capable to solve much larger size of the problem with reasonable solution quality and computational time. 2018-12-11T02:27:03Z 2019-03-14T08:04:20Z 2018-12-11T02:27:03Z 2019-03-14T08:04:20Z 2016-12-27 Conference Paper IEEE International Conference on Industrial Engineering and Engineering Management. Vol.2016-December, (2016), 60-64 10.1109/IEEM.2016.7797836 2157362X 21573611 2-s2.0-85009833692 https://repository.li.mahidol.ac.th/handle/123456789/43270 Mahidol University SCOPUS https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85009833692&origin=inward
institution Mahidol University
building Mahidol University Library
continent Asia
country Thailand
Thailand
content_provider Mahidol University Library
collection Mahidol University Institutional Repository
topic Business, Management and Accounting
Engineering
spellingShingle Business, Management and Accounting
Engineering
L. Boonma
R. Sirovetnukul
T. Sarttra
Single machine scheduling for multi-assembly jobs with preemption
description © 2016 IEEE. This research proposes a mathematic model for scheduling multi-assembly jobs with uncertain arrival of raw materials or sub-assembly parts and allowable preemption, aiming to minimize tardiness penalty and set-up cost under a single machine. The experimental results show that using the exact algorithm (Branch and Bound) in Lingo 12 is not capable of solve the large-sized problems. Balancing tardiness and set-up cost (BTS) algorithm, therefore, is developed and is capable to solve much larger size of the problem with reasonable solution quality and computational time.
author2 Mahidol University
author_facet Mahidol University
L. Boonma
R. Sirovetnukul
T. Sarttra
format Conference or Workshop Item
author L. Boonma
R. Sirovetnukul
T. Sarttra
author_sort L. Boonma
title Single machine scheduling for multi-assembly jobs with preemption
title_short Single machine scheduling for multi-assembly jobs with preemption
title_full Single machine scheduling for multi-assembly jobs with preemption
title_fullStr Single machine scheduling for multi-assembly jobs with preemption
title_full_unstemmed Single machine scheduling for multi-assembly jobs with preemption
title_sort single machine scheduling for multi-assembly jobs with preemption
publishDate 2018
url https://repository.li.mahidol.ac.th/handle/123456789/43270
_version_ 1763494965107752960

Similar Items