摘要
In this paper, we study a single-batch-processing machine (SBPM) scheduling problem by considering a just-intime criterion. Our objective is to minimize the total weighted earliness and tardiness (WET) penalties of jobs, where the penalty rates of jobs are job-independent but the earliness and tardiness penalty rates are different, and different jobs may have different due dates. An SBPM can process several jobs simultaneously as a batch. We first model this scheduling problem using a mixed-integer linear model. We design two priority rules, i.e., earliest due date (EDD) and earliest starting time (EST), to sort jobs. Based on our analysis on the mathematical properties of this scheduling problem, we propose two heuristic algorithms AABF and ITSLS to construct and improve the near-optimal schedules. We also devise a lower bound method on a new approximate time-indexed formulation. Extensive numerical experiments demonstrate the effectiveness and efficiency of our algorithms.
学科与关键词
- Hybrid approach for a single -batch -processing machine scheduling problem with a just -in -time objective and consideration of non-identical due dates of jobsZhang, Hongbin; Wu, Feng; Yang, Zhen*COMPUTERS & OPERATIONS RESEARCH, 2021, 128: 105194.被引 7
- Human and Machine Effects in a Just-In-Time Scheduling ProblemEren, Tamer*HUMAN FACTORS AND ERGONOMICS IN MANUFACTURING, 2009, 19(4): 294-299.被引 12
- The just-in-time job-shop scheduling problem with distinct due-dates for operationsAhmadian, Mohammad Mahdi; Salehipour, Amir*JOURNAL OF HEURISTICS, 2021, 27(1-2): 175-204.被引 9
