Conflicting interests in the timing of jobs
Article Abstract:
Surgical procedures in a hospital operating room, which are representative of jobs of unknown duration in a single facility, are analyzed to elucidate the scheduling problem arising from the sequencing of jobs that arrive due to a random process. The uncertainty of the job makes the time at which the facility will be available for the next job unknown. The scheduler must select a starting time for the next job, a process complicated by the presence of a minimum of one individual, in this case the surgeon, known as the agent. The scheduling problem of conflicting interests in the timing of jobs is modelled as a game between the scheduler and the agent in which the scheduler trades off the cost of letting the agent wait and of letting the facility remain idle between jobs. The agent, in turn, trades off the cost of waiting against the cost of being late. Research results reveal the conditions under which the scheduler must take the behavior of the agent into account.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1990
User Contributions:
Comment about this article or add new information about this topic:
Scheduling economic lot size production runs
Article Abstract:
The lot-sizing problem characterizing single-facility, multi-product production facilities poses many problems in scheduling. The results of traditional economic lot size calculations are useful when applied to a single product, but the production of multiple products requires the translation of production quantities into a schedule that satisfies in a timely manner the demands of each product within the capacity of the facility. A solution to the stockout concern arising in the scheduling of economic lot size production runs for multi-product facilities is proved by creating an 'a posteriori' test to create a workable production sequence. The stockout concern is addressed by mathematical programming approaches using alternative formulations. The tradeoffs between delivery performance and the efficiency of scheduling can be examined with goal programming procedures.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1990
User Contributions:
Comment about this article or add new information about this topic:
Sufficient working subsets for the tour scheduling problem
Article Abstract:
The problem of organizing cost-effective employee schedules in service organizations can be solved by reformulating the problem from a working subset of all possible scheduling tours. The solution can then be derived depending on the types of schedules included in the model. A method for selecting working subsets using a column generation heuristic is presented and is found to compare favorably with models using all feasible tours.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1991
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: An Integer Programming Algorithm with Network Costs for Solving the Assembly Line Balancing Problem. A O-1 Model for Solving the Corrugator Trim Problem
- Abstracts: Routing and scheduling on a shoreline with release times. Some heuristics for scheduling jobs on parallel machines with setups
- Abstracts: Dynamic programming and strong bounds for the 0-1 Knapsack problem. A new algorithm for the 0-1 knapsack problem
- Abstracts: Discrete lotsizing and scheduling by batch sequencing. An exact algorithm for the Resource-Constrained Project Scheduling problem based on a new mathematical formulation
- Abstracts: Cross-cultural training effectiveness: a review and a theoretical framework for future research. Toward a comprehensive model of international adjustment: an integration of multiple theoretical perspectives