Journal ArticleDOI
Heuristics for scheduling in a Kanban system with dual blocking mechanisms
Reads0
Chats0
TLDR
Two heuristics are proposed with the twin objectives of minimizing the total weighted waitingtime of containers and total weighted flowtime of part-types and the results of computational evaluation are presented.About:
This article is published in European Journal of Operational Research.The article was published on 1997-12-16. It has received 11 citations till now. The article focuses on the topics: Kanban & Heuristics.read more
Citations
More filters
Journal ArticleDOI
Literature review of JIT-KANBAN system
TL;DR: In this paper, a survey of the JIT-Kanban literature is presented, focusing on the philosophy of JIT, and the concept involved in the push and pull system.
Journal ArticleDOI
A genetic algorithmic approach to multi-objective scheduling in a Kanban-controlled flowshop with intermediate buffer and transport constraints
TL;DR: In this article, a non-dominated and normalized distance-ranked sorting multi-objective genetic algorithm (NDSMGA) was proposed to solve the problem of extended permutation flowshop scheduling with the intermediate buffers.
Journal ArticleDOI
Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops - Part 2
TL;DR: In this paper, a heuristic is proposed to address the problem of determining the number of containers, and production and withdrawal kanbans, and also determining the sequence of containers to minimize the sum of weighted flowtime, weighted earliness and weighted tardiness of containers.
Journal ArticleDOI
A state of art review on optimization techniques in just in time
Ineen Sultana,Imtiaz Ahmed +1 more
TL;DR: A literature review on research works based on JIT was carried out and presented in this article, where the philosophy of JIT, and the concept involved in Kanban optimization and later this paper reviews literature on optimization Technique in JIT implementation.
Journal ArticleDOI
Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops - Part 1
TL;DR: In this paper, the authors consider a kanban-controlled flow shop and present recursive equations for time-tabling of containers in a given sequence, where the flow shop is characterized by a production batch of a part-type (or job) divided into kanban lots or containers.
References
More filters
Journal ArticleDOI
Optimal two- and three-stage production schedules with setup times included
TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.
Book
Introduction to sequencing and scheduling
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Journal ArticleDOI
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
Book
Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
TL;DR: In this article, an introduction to the mathematics of the job shop is presented, with a focus on the sequential and scheduling aspects of the system. But this approach is not suitable for all job-shop scenarios.
Journal ArticleDOI
A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
TL;DR: A simple algorithm for the solution of very large sequence problems without the use of a computer that produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time.