An Application of Tabu Search Technique in Parallel Machine Production Scheduling A Case Study of an Elastic Knitting Factory
Explore this paper's citation graph
- Type
- article
- Published
- 2005-01-01
- Cited by
- 0
- References
- 12
- OpenAlex
- https://openalex.org/W47413953
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:107587300
Keywords
Tabu search, Tardiness, Scheduling (production processes), Computer science, Due date
References
- Optimization in operations research
- Parallel machine scheduling with release time and machine eligibility restrictions
- Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective
- A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times
- Scheduling jobs on parallel machines applying neural network and heuristic rules
- Parallel machine scheduling with release dates, due dates and family setup times
- Parallel machine scheduling with earliness and tardiness penalties
- A tabu search algorithm for parallel machine total tardiness problem
- Unrelated parallel machine scheduling with setup times using simulated annealing
- Tabu Search - Part II
- Applied Statistics and Probability for Engineers
- Applied Statistics and Probability for Engineers, Third edition
Cited by
No citing papers recorded for this paper.
Related papers
- Group-based production scheduling for make-to-order production
- Parallel reactive tabu search for job-shop scheduling problems considering energy management
- Scheduling with alternatives: a link between process planning and scheduling
- Unrelated parallel machine scheduling with job splitting
- Solving a Job-shop Scheduling Problem Based on a Tabu Search Algorithm
- A Tabu Search Approach for Lot Sizing and Scheduling Problem with Arbitrary Job Sizes and Due Date Considerations
- Production plan scheduling on SMT manufacturing lines
- An agile-loading algorithm for job-oriented scheduling
- An interactive high speed scheduling method by tabu search for a large-scale job shop problem with group constraints