By Topic

Operator scheduling approaches in group technology cells-information request analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Houn-Gee Chen ; Graduate Inst. of Inf. Manage., Nat. Chung-Chen Univ., Chia-Yi, Taiwan

This paper examines the group technology (GT) scheduling problems, in which each cell is staffed with one operator. The role of the operator is to load jobs into machines, to unload jobs from machines, and to transport jobs between machines. Since the productivity of the cell is directly proportional to the level of productive work performed by the operator, the manner in which the operator moves between machines affects productivity. Although the optimal operator schedule/walking-pattern has been shown to be the best operator schedule for well-structured production environments, the underlying assumptions of the optimal schedule often limit its practical implications. With the current popularity of gust-in-time production, the problem of finding an efficient operator schedule/walking-pattern has become a critical issue in shop floor scheduling. According to the information requirements, this paper devises three heuristic approaches: a scheduling rule, multiple scheduling rules (MSR), and cycle switching rules (CSR). This paper shows that there is a tradeoff between the quality of the resulting schedule and the information contents of heuristics used

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:25 ,  Issue: 3 )