Person
We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson's rule. For m = 2,
It is widely acknowledged that supply chain ‘glitches’ may have detrimental effects on company performance and shareholder wealth. However, much less is known about the decision makers themselves, the way they manage crises, and whether their actions are predictable.
We describe a real world case study that involves the monthly planning and scheduling of the sand-casting department in a metal foundry. The problem can be characterised as a single-level multi-item capacitated lot-sizing model with a variety of additional process-specific constraints. The main obje
Adoption rates of traditional Operations Research (OR) based decision support systems (DSS) suffer from perceived complexity of the underlying model and its detrimental effect on user-friendliness. The mental effort required to understand abstract models can hinder adoption. This barrier may seem ev
Advanced Planning and Scheduling (APS) systems have gained renewed interest from academics and practitioners. However, literature on APS adoption is scant. This study explores the impact of organizational and innovation related factors on the adoption of APS systems from a factors approach. The resu
The organizational theory literature argues that the more uncertain the environment, the more likely the firm’s operational decision structure is decentralized. However, it remains unclear which uncertainty dimensions (i.e. complexity, rate of change and lack of information) impacts the production p
In this paper, we present a planning and control framework for manufacture-to-order environments that enables and supports agile-based discrete parts manufacturing. The characteristic elements of our framework are that it is decentralized, logistics and business oriented, and that it recognizes that
We address the problem of determining the home positions for m automated guided vehicles (AGVs) in a loop layout where n pickup points are positioned along the circumference (m<n). A home position is the location where idle AGVs are held until they are assigned to the next transportation task. The h
We study the problem of scheduling a chain-reentrant shop, in which each job goes for its processing first to a machine called the primary machine, then to a number of other machines in a fixed sequence, and finally back to the primary machine for its last operation. The problem is to schedule the j
Go to page top
Go back to contents
Go back to site navigation