Home // ADVCOMP 2015, The Ninth International Conference on Advanced Engineering Computing and Applications in Sciences // View article

A Lot Scheduling Problem on a Single Machine with Indivisible Orders

Authors:
Wen-Hung Kuo
Dar-Li Yang

Keywords: lot scheduling; single machine; total completion time; indivisible order; integer programming

Abstract:
In this paper, a lot scheduling problem on a single machine with indivisible orders is studied. The objective is to minimize the total completion time of all orders. We use a binary integer programming approach to solve this problem. The binary integer programming approach with run time limit is considered as one heuristic method. As compared to a lower bound, it turns out the average performance of the method is really good.

Pages: 77 to 79

Copyright: Copyright (c) IARIA, 2015

Publication date: July 19, 2015

Published in: conference

ISSN: 2308-4499

ISBN: 978-1-61208-419-0

Location: Nice,France

Dates: from July 19, 2015 to July 24, 2015