An optimal method for the preemptive job shop scheduling problem
Authors:
- Abbas EbadiAEAbbas Ebadi
- Ghasem MoslehiGMGhasem Moslehi
- 1 May 2013
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 40 (5) , 1314-1327
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industryComputers & Industrial Engineering, 2006
- Job Shop Scheduling with Unit Processing TimesMathematics of Operations Research, 2006
- A job shop scheduling heuristic for varying reward structuresMathematical and Computer Modelling, 2005
- Approximation schemes for job shop scheduling problems with controllable processing timesEuropean Journal of Operational Research, 2005
- Makespan Minimization in Job Shops: A Linear Time Approximation SchemeSIAM Journal on Discrete Mathematics, 2003
- On-line and off-line preemptive two-machine job shop schedulingJournal of Scheduling, 2000
- Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling ProblemJournal of Heuristics, 1999
- Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing SchedulesCombinatorica, 1999
- Resource Constraints for Preemptive Job-shop SchedulingConstraints, 1998
- Packet routing and job-shop scheduling inO(congestion+dilation) stepsCombinatorica, 1994