Skip to main content
Article thumbnail
Location of Repository

A methodology for real-time scheduling of jobs with splitting on unrelated parallel machines

By 

Abstract

Graduation date: 2000Unrelated parallel machines are machines that perform the same function but have\ud different capacity or capability. Thus, the processing time of each job would be different\ud on machines of different types. The scheduling environment considered is dynamic in\ud both job release time and machine availability. Additionally, each job considered can\ud have different weight, and due date. Split jobs are also considered in this research. The\ud number of jobs that needs to be processed in split-modes is pre-determined and not part\ud of the scheduling decision. Additional constraints are imposed on split jobs to ensure that\ud the absolute difference in completion time of the split portions of a job is within a user-specified margin. These constraints are supported by the Just-In-Time manufacturing\ud concept where inventory has to be maintained at a very low or zero level. The objective\ud of this research is to minimize the sum of the weighted tardiness of all jobs released\ud within the planning horizon.\ud The research problem is modeled as a mixed (binary) integer-linear programming\ud model and it belongs to the class of NP-hard problems. Thus, one cannot rely on using\ud an implicit enumeration technique, such as the one based on branch-and-bound, to solve\ud industry-size problems within a reasonable computation time. Therefore, a higher-level\ud search heuristic, based on a concept known as tabu search, is developed to solve the\ud problems. Four different methods based on simple and composite dispatching rules are\ud used to generate the initial solution that is used by tabu-search as a starting point. Six\ud different tabu-search based heuristics are developed by incorporating the different\ud features of tabu search. The heuristics are tested on eight small problems and the quality of their solutions is compared to their optimal solutions, which are obtained by applying\ud the branch-and-bound technique. The evaluation shows that the tabu-search based\ud heuristics are capable of obtaining solutions of good quality within a much shorter time.\ud The best performer among these heuristics recorded a percentage deviation of only\ud 1.18%.\ud The performance of the tabu-search based heuristics is compared by conducting a\ud statistical experiment that is based on a split-plot design. Three sizes of problem\ud structures, ranging from 9 jobs to 60 jobs and from 3 machines to 15 machines are used\ud in the experiment. The results of the experiment reveal that in comparison to other\ud initial-generation methods, the composite dispatching rule is capable of obtaining initial\ud solutions that significantly accelerate the tabu search based heuristic to get to the final\ud solution. The use of long-term memory function is proven to be advantageous in solving\ud all problem structures. The long-term memory based on maximum-frequency strategy is\ud recommended for solving the small problem structure, while the minimum-frequency\ud strategy is preferred for solving medium and large problem structures. With respect to\ud the use of tabu-list size as a parameter, the variable tabu-list size is preferred for solving\ud the smaller problem structure, but the fixed tabu-list size is preferred as the size of the\ud problems grows from small to medium and then large

Year: 2000
OAI identifier: oai:ir.library.oregonstate.edu:1957/33182
Provided by: ScholarsArchive@OSU

Suggested articles

Citations

  1. 1990a, Tabu Search: A Tutorial. Interfaces, doi
  2. 1990b, Tabu Search Part II. doi
  3. (1995). A diversification strategy for a tabu search heuristic to solve the multiprocessor scheduling problem with sequence dependent setup times. doi
  4. (1997). A heursitic to minimize the total weighted tardiness with sequence - dependent setups. doi
  5. (1996). A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search. doi
  6. (1990). A state -of -the -art review of parallel- machine scheduling research. doi
  7. (1997). A tabu search -based approach for scheduling job -shop type flexible manufacturing systems. doi
  8. (1979). Algorithms for Scheduling Tasks on doi
  9. (1971). An improved method for scheduling independent tasks. doi
  10. (1995). An overview of tabu search approaches to production scheduling problems. Intelligent Scheduling Systems doi
  11. (1994). Applying tabu search with influential diversification to multiprocessor scheduling. doi
  12. (1987). Approximation algorithms for scheduling unrelated parallel machines. doi
  13. (1996). Bicriteria scheduling problem for unrelated parallel machines. doi
  14. (1977). Complexity of machine scheduling problems. doi
  15. (1984). Design and Analysis of Experiments (NewYork:
  16. (1968). Distribution -Free Statistical Tests doi
  17. (1988). Distribution -Free Tests (London: Unwin Hyman).
  18. (1999). Dry kiln scheduling in furniture production. doi
  19. (1994). for Windows version 3.0,
  20. (1986). Future paths for integer programming and links to artificial intelligence. doi
  21. (1965). Heuristic sequencing ofjobs with single and multiple components.
  22. (1991). Heuristics for Minimizing Mean Tardiness for m Parallel Machines. doi
  23. (1991). Heuristics for Scheduling Unrelated Parallel Machines. doi
  24. (1981). Myopic heuristics for the single machine weighted tardiness problem. Working Paper #28- 81 -82, Graduate School of Industrial Administration,
  25. (1996). Parallel machine scheduling with release dates, due dates, and family setup times. doi
  26. (1997). Parallel machine scheduling with release time and machine eligibility restrictions. doi
  27. (1999). Practical Nonparametric Statistics doi
  28. (1987). Priority rules for job shops with weighted tardiness costs. doi
  29. (1995). Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria. doi
  30. (1999). Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. doi
  31. (1987). Scheduling jobs with release dates and tails on identical machines to minimize the makespan. doi
  32. (1996). Scheduling of unrelated parallel machines when machine availability is specified. Production Planning and Control, doi
  33. (1997). Search heuristics for a parallel machine scheduling problem with ready times and due dates. doi
  34. (1989). Tabu Search Part I. doi
  35. (1998). The impact of alternative cell locations and alternative routes of material handling equipment in the design of cellular manufacturing systems. MS thesis,
  36. (1989). The single machine early / tardy problem. doi
  37. (1994). The total tardiness problem: review and extensions. doi
  38. (1967). Theory of Scheduling
  39. (1994). Unrelated parallel machine scheduling using local search. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.