Job-shop scheduling with processing alternatives
Article Abstract:
An extension of job-shop scheduling where job routings are directed acyclic graphs of special structures is studied with the help of two heuristic algorithms, tabu search and a genetic algorithm. These algorithms are compared based on various test problems and the successes of the two subroutines on open-shop instances are reported.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
User Contributions:
Comment about this article or add new information about this topic:
An efficient genetic algorithm for job shop scheduling with tardiness objectives
Article Abstract:
A genetic algorithm (GA) for job shop scheduling problems with release and due dates, with various tardiness criteria as objectives are proposed. A heuristic reduction of the search space can help the algorithm to find better solution in a shorter computation time.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
An effective architecture for learning and evolving flexible job-shop schedules
Article Abstract:
A study on learnable genetic architecture with relation to learning of flexible job-shop schedules is presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: For Rothschild, bigger doesn't necessarily mean better. Lazard taps France official for managing-director post
- Abstracts: Deutsche Boerse reserves right to bid for LSE. Deutsche Boerse stays firm
- Abstracts: A tabu search algorithm for self-healing ring network design. Solving spread spectrum radar polyphase code design problem by tabu search and variable neighborhood search