scispace - formally typeset
Open AccessJournal ArticleDOI

MICRO-BOSS: A micro-opportunistic factory scheduler

Norman Sadeh
- 01 Jul 1993 - 
- Vol. 6, Iss: 3, pp 377-392
Reads0
Chats0
TLDR
Experimental results suggest that the extra flexibility of a micro-opportunistic approach to scheduling often translates into important reduction in schedule costs.
Abstract
Recent research in factory scheduling has demonstrated the benefits of building schedules by first optimizing the sequencing of bottleneck machines, namely, machines whose utilizations are expected to be particularly high. Within this approach, two scheduling perspectives are generally adopted: a resource-centered perspective is used to help maximize the utilization of bottleneck machines, and a job-centered perspective is used later to compactly complete each job schedule (i.e., to reduce work-in-process inventory within each job). Because new secondary bottlenecks may arise during the construction of the schedule, recent scheduling systems have been designed with an ability to switch back and forth between their resource-centered scheduling perspective and their job-centered scheduling perspective. This ability to revise the current scheduling strategy dynamically has been termed opportunistic scheduling . However, because these schedulers require scheduling large resource subproblems or large job subproblems before revising their scheduling strategy, we refer to them as macro-opportunistic schedulers . Instead, this paper describes MICRO-BOSS, a so-called micro-opportunistic scheduler , that can revise its scheduling strategy each time an operation is scheduled. Experimental results suggest that the extra flexibility of a micro-opportunistic approach to scheduling often translates into important reduction in schedule costs.

read more

Citations
More filters
Journal ArticleDOI

On combinatorial auction and Lagrangean relaxation for distributed resource scheduling

TL;DR: This study investigates a new method based on a distributed and locally autonomous decision structure using the notion of combinatorial auction, and shows that not only can this auction mechanism be used to handle complex resource scheduling problems, but there exist strong links between combinatorsial auction and Lagrangean-based decomposition.
Journal ArticleDOI

Knowledge-based production management approaches, results and prospects

TL;DR: An overview of artificial intelligence concepts and techniques in production management applications and how they have provided frameworks for making traditional operations research techniques more accessible and usable in practical production management settings is provided.
Journal ArticleDOI

Coordination mechanisms for multi-agent manufacturing systems: applications to integrated manufacturing scheduling

TL;DR: In this article, the authors present a multi-agent framework for managing a printed circuit board manufacturing system in an integrated fashion. But the authors emphasize the coordination mechanisms needed for ensuring the orderly operations and concerted decision-making among the components.
Journal ArticleDOI

Scheduling of automated guided vehicles in a decision making hierarchy

TL;DR: In this paper, an analytical model is proposed to incorporate the automated guided vehicle (AGV) system into the overall decision making hierarchy, and a mathematical formulation is developed to include interaction between the AGV module and other modules in the system by considering the restrictions of the material handling system.
Journal ArticleDOI

A generic library of problem solving methods for scheduling applications

TL;DR: The generic nature of this library is demonstrated by constructing seven methods for scheduling as an alternative specialization of the model, and it is validated on a number of applications to demonstrate its generic nature and effective support for developing scheduling applications.
References
More filters
Book

Computers and Intractability: A Guide to the Theory of NP-Completeness

TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book

Introduction to sequencing and scheduling

A. J. Clewett
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

The Shifting Bottleneck Procedure for Job Shop Scheduling

TL;DR: An approximation method for solving the minimum makespan problem of job shop scheduling by sequences the machines one by one, successively, taking each time the machine identified as a bottleneck among the machines not yet sequenced.
Book

Decision Systems for Inventory Management and Production Planning

TL;DR: In this article, an in-depth discussion of the major decisions in production planning, scheduling, and inventory management faced by organizations, both private and public, is presented, as well as the latest systems used to make decisions, including Just-in-Time Manufacturing, KANBAN, Distribution Requirements Planning and PUSH Control.