JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY

Dae-Young Chung () and Byung-Cheon Choi ()
Additional contact information
Dae-Young Chung: SAP Korea Ltd., 27-28F, MMAA Building 467-12, Dogok-dong, Gangnam-gu, Seoul 135-700, Korea
Byung-Cheon Choi: Department of Business Administration, Chungnam National University, 79 Daehangno, Yuseong-gu, Daejeon 305-704, Korea

Asia-Pacific Journal of Operational Research (APJOR), 2013, vol. 30, issue 02, 1-14

Abstract: This paper considers the single-machine scheduling problem, where job parameters are uncertain and the performance measure is to maximize the weighted number of just-in-time jobs, defined as jobs completed exactly on their due dates. Uncertainty is described through a finite set of well-defined scenarios. The criteria for this environment is to minimize the maximum deviation from optimality for all scenarios. We present the computational complexity results for several cases.

Keywords: Scheduling; uncertainty; just in time; FPTAS; computational complexity (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595912500558
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:30:y:2013:i:02:n:s0217595912500558

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595912500558

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().