Citation
Minimizing Makespan with Multiple Orders per Job in Mixed Flowshops. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 301-308, 2007.
Paper
Abstract
We investigate a new scheduling problem, multiple orders per job (MOJ), to optimize the makespan in a 3-machine flowshop consisting of two types of machines: item-processing and lotprocessing. MOJ problems are restricted in the number of jobs formed from orders as well as a job capacity limit. Job processing time for an item-processing machine is proportional to the size of the job, while job processing time for a lot-processing machine is not. We extend prior results by characterizing the opposing effects of item/lot machines on optimal job formation and job scheduling in flowshops that contain both types of machines. Job domination in this context is defined, and precise conditions are provided to determine when lower bounds are equivalent to smaller problems.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-301-308-P, author = {J. D. Laub and J. W. Fowler and A. B. Keha},
title = {Minimizing Makespan with Multiple Orders per Job in Mixed Flowshops},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {301--308},
note = {Paper},
abstract = {We investigate a new scheduling problem, multiple orders per job (MOJ), to optimize the makespan in a 3-machine flowshop consisting of two types of machines: item-processing and lotprocessing. MOJ problems are restricted in the number of jobs formed from orders as well as a job capacity limit. Job processing time for an item-processing machine is proportional to the size of the job, while job processing time for a lot-processing machine is not. We extend prior results by characterizing the opposing effects of item/lot machines on optimal job formation and job scheduling in flowshops that contain both types of machines. Job domination in this context is defined, and precise conditions are provided to determine when lower bounds are equivalent to smaller problems.},
owner = {user},
timestamp = {2012.05.21},
webpdf = {2007-301-308-P.pdf} }