Adjusting scheduling model with release and due dates in production planning. Issue 1 (1st January 2017)

• Record Type: Journal Article
• Authors: Chinos, Elisa; Vakhania, Nodari
• Is Part Of: Cogent engineering. Volume 4:Issue 1(2017)
• Publication Date: 2017-01-01
• Subjects: production planning -- scheduling model -- scheduling algorithm -- heuristic -- release time -- delivery time -- due-date; Engineering -- Periodicals; Technology -- Periodicals; Engineering; Technology; Periodicals; 620
• DOI: Https://www.tandfonline.com/doi/10.1080/23311916.2017.1321175
• Languages: English
• ISSNs: 2331-1916

Abstract

Abstract : Motivated by the conjecture that an interaction between scheduling and pre-scheduling phases in production planning may give certain benefits, we conduct a detailed study of the optimality conditions and dominance relations for a strongly NP-hard single-machine scheduling model when jobs have release and due-dates and the objective is to minimize maximum job lateness. By exploring the inherent structure of the problem, we establish the optimality conditions when the problem can be efficiently solved. We come to an NP-hard special case of the problem with only two possible job release times, that as we show allows stricter dominance rules and optimality conditions verifiable in polynomial time. The established properties give a potential of a beneficial interaction between scheduling and pre-scheduling phases in production planning, and also provide basic theoretical background for the construction of efficient heuristic and implicit enumerative algorithms.