An Approach for Flexible Job-Shop Scheduling with Separable Sequence-Dependent Setup Time

@article{Guimaraes2006AnAF,
  title={An Approach for Flexible Job-Shop Scheduling with Separable Sequence-Dependent Setup Time},
  author={Kairon Freitas Guimaraes and M{\'a}rcia Aparecida Fernandes},
  journal={2006 IEEE International Conference on Systems, Man and Cybernetics},
  year={2006},
  volume={5},
  pages={3727-3731}
}
Job-Shop Scheduling Problem Is considered as one of the hardest combinatorial optimization problem. Any known algorithm is not capable to find an optimum solution in polynomial time that characterizes it as NP-complete problem. There are many applications of this problem where considering the setup time is necessary (cost), which is the work to prepare the machines for the execution of jobs. This aspect has been neglected or considered as part of the processing time of the jobs. In fact, this… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 18 references

A Tutorial Survey of Job-Shop Scheduling Problems using Genetic Algorithms - I

  • R. Cheng, M. Gen, Y. Tsujimura
  • Representation", Computers & Industrial…
  • 1996
Highly Influential
5 Excerpts

A Review of Scheduling Research involving Setup Considerations

  • A. Allahverdi, J.N.D. Gupta, T. Aldowaisan
  • Omega The International Journal of Management…
  • 1999
Highly Influential
3 Excerpts

Scheduling Reentrant Flexible Job Shops with Sequence- Dependent Setup Times

  • D. Philip
  • MSc. Thesis, Montana State University, Montana
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…