Group scheduling and job-dependent due window assignment based on a common flow allowance

Authors:
Min Ji;Ke Chen;Jiaojiao Ge;T. C. E. Cheng
Affiliations:
School of Computer Science and Information Engineering, Contemporary Business and Trade Research Center, Zhejiang Gongshang University, Hangzhou 310018, PR China;School of Computer Science and Information Engineering, Contemporary Business and Trade Research Center, Zhejiang Gongshang University, Hangzhou 310018, PR China;School of Computer Science and Information Engineering, Contemporary Business and Trade Research Center, Zhejiang Gongshang University, Hangzhou 310018, PR China;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong
Venue:
Computers and Industrial Engineering
Year:
2014

Citing 5
Cited 0

Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine

Manufacturing & Service Operations Management
Optimal due date assignment and resource allocation in a group technology scheduling environment

Computers and Operations Research
Single machine common flow allowance scheduling with a rate-modifying activity

Computers and Industrial Engineering
Single machine scheduling with common due date assignment in a group technology environment

Mathematical and Computer Modelling: An International Journal
Group sequencing around a common due date

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a single-machine group scheduling and job-dependent due window assignment problem in which each job is assigned an individual due window based on a common flow allowance. In the group technology environment, the jobs are divided into groups in advance according to their processing similarities and all the jobs of the same group are processed consecutively in order to improve production efficiency. A sequence-independent machine setup time precedes the processing of the first job of each group. A job completed earlier (later) than its due window will incur an earliness (tardiness) penalty. Our goal is to find the optimal sequence for both the groups and jobs, together with the optimal due window assignment, to minimize the total cost that comprises the earliness and tardiness penalties, and the due window starting time and due window size costs. We give an O(nlogn)time algorithm to solve this problem.