-
作者：MITRA, D; MITRANI, I
作者单位：Newcastle University - UK
摘要：We describe and analyze a discipline called kanban for the control and coordination of cells in large-scale manufacturing facilities. There are many cells in tandem and also a process of arriving consumers; each consumer queues as long as necessary before departing with a product finished by the last cell. The coordination scheme relies on the circulation of a fixed number of cards (or kanbans) in each cell. This paper differs from our earlier paper in that here the process of consumers modula...
-
作者：AHMADI, RH; TANG, CS
摘要：This paper presents an operation partitioning problem (OPP) that arises from the design of an automated assembly system. To reduce the traffic flow of the system, the OPP assigns operations to machines so that the total number of movements of jobs between machines is minimized. This problem has applications in flexible manufacturing and VLSI design. In flexible manufacturing, OPP relates to a part grouping problem in which different parts are grouped into families. In VLSI design, this problem...
-
作者：HALL, NG; POSNER, ME
作者单位：University System of Ohio; Ohio State University
摘要：This paper and its companion (Part II) concern the scheduling of jobs with cost penalties for both early and late completion. In Part I, we consider the problem of minimizing the weighted sum of earliness and tardiness of jobs scheduled on a single processor around a common due date, d. We assume that d is not early enough to constrain the scheduling decision. The weight of a job does not depend on whether the job is early or late, but weights may vary between jobs. We prove that the recogniti...
-
作者：HALL, NG; KUBIAK, W; SETHI, SP
作者单位：Memorial University Newfoundland; University of Toronto
摘要：A companion paper (Part I) considers the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late. This paper (Part II) considers the problem of minimizing the unweighted earliness and tardiness of jobs, allowing the possibility that d is early enough to constrain the scheduling decision. We describe several optimality conditions. The recognition version of the problem is shown to be NP-complete ...
-
作者：MCCLAIN, JO; MOODIE, DR
作者单位：Syracuse University
摘要：Counterintuitive optimal buffer capacity allocation patterns appeared in a 1988 paper by J. M. Smith and S. Daskalaki. This comment explains those patterns with examples and a simple diagram. Intuition gained from this explanation should be of use for researchers and practitioners alike.
