Scheduling with High Variety of Customized Compound Products
Journal Title: Decision Making in Manufacturing and Services - Year 2007, Vol 1, Issue 1
Abstract
Domestic appliance is an instance of manufacturing various products on clients demand with frequent changes of production. Although the technological process for each individual product is relatively simply, the variety of products, mixed orders, frequent machines changeovers, machines with unusual service policy, lack or limited storage, etc., generates quite nontrivial planning, batching and scheduling problems and furthermore of a huge size. In this paper, we present speci c real process of production of refrigerators, mathematical and graph models of the problem and an outline of solution algorithm, based the on local search approach.
Authors and Affiliations
Czesław Smutnicki
Keywords
Related Articles
- EP ID EP422892
- DOI 10.7494/dmms.2007.1.2.91
- Views 77
- Downloads 0
A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows
This paper presents a Resource-Constrained Project Scheduling Problem (RCPSP) settled by contractual milestones. The criterion analysed here is the maximisation of aggregate discounted cash flows from the contractor’s pe...
Editorial
Welcome to the premier issue of the new international journal Decision Making in Manufacturing and Services. The launching of a new journal is a unique opportunity to introduce its mission, scope, and coverage areas.
Models, methods and information technologies of protection of corporate systems of transport based on intellectual identification of threats
In article results of researches on development of methods and models of intellectual recognition of threats to information systems of transport. The article to contain results of the researches, allowing to raise level...
A Distributed Decision-Support System for Virtual Prototyping
Virtual Prototyping (VP) is a data-driven design process that promotes both knowledge reuse and innovation. High-profile applications in the automotive and aerospace industries have demonstrated its potential to signific...
On Efficient Coloring of Chordless Graphs
We are given a simple graph G = (V, E). Any edge e ∈ E is a chord in a path P ⊆ G (cycle C ⊆ G) iff a graph obtained by joining e to path P (cycle C) has exactly two vertices of degree 3. A class of graphs without any ch...