Nondominated Schedules for a Job-Shop with Two Competing Users
Authors:
- 1 July 2000
- journal article
- Published by Springer Nature in Computational and Mathematical Organization Theory
- Vol. 6 (2) , 191-217
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Model, Algorithms and Strategy for Train PathingJournal of the Operational Research Society, 1995
- The Machine Duplication Problem in a Job Shop with Two JobsInternational Transactions in Operational Research, 1995
- A fast heuristic for the train scheduling problemComputers & Operations Research, 1994
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due DateOperations Research, 1991
- Optimal Pacing of Trains in Freight Railroads: Model Formulation and SolutionOperations Research, 1991
- Sequencing with Earliness and Tardiness Penalties: A ReviewOperations Research, 1990
- An efficient algorithm for the job-shop problem with two jobsComputing, 1988
- A Combinatorial Auction Mechanism for Airport Time Slot AllocationThe Bell Journal of Economics, 1982
- A Geometric Model and a Graphical Algorithm for a Sequencing ProblemOperations Research, 1963
- Solution of the Akers-Friedman Scheduling ProblemOperations Research, 1960