A Reduced-Complexity Algorithm for Two-Job Shop Scheduling Problems With Availability Constraints

IFAC Proceedings Volumes
doi 10.3182/20090603-3-ru-2001.0543
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Hybrid Genetic Algorithm With Multiparents Crossover for Job Shop Scheduling Problems

Mathematical Problems in Engineering
MathematicsEngineering
2015English

MPM Job-Shop Under Availability Constraints

International Journal of Computers, Communications and Control
MathematicsComputer NetworksComputer Science ApplicationsComputational TheoryCommunications
2009English

Flexible Job-Shop Scheduling Problems

English

An Adaptive Pursuit Genetic Algorithm for Solving Job-Shop Scheduling Problems

2018English

A Hybrid Grey Cuckoo Search Algorithm for Job-Shop Scheduling Problems Under Fuzzy Conditions

Advances in Production Engineering And Management
IndustrialMechanical EngineeringNuclearManufacturing EngineeringHigh Energy PhysicsManagement ScienceInnovationManagement of TechnologyOperations Research
2018English

A Hybrid Evolutionary Algorithm for Solving Flexible Job Shop Scheduling Problem

IJCI. International Journal of Computers and Information
2009English

An Adaptive Scheduling Algorithm for Dynamic Jobs for Dealing With the Flexible Job Shop Scheduling Problem

Wirtschaftsinformatik
Information Systems
2019English

A Promising Initial Population Based Genetic Algorithm for Job Shop Scheduling Problem

Journal of Software Engineering and Applications
2016English

Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy