z-logo
open-access-imgOpen Access
A New Heuristic Algorithm using Pascal's Triangle to Determine more than one Sequence having Optimal/ near Optimal Make Span in Flow Shop Scheduling Problems
Author(s) -
A. Baskar,
M. Anthony Xavior
Publication year - 2012
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/4815-7053
Subject(s) - computer science , pascal (unit) , algorithm , flow shop scheduling , scheduling (production processes) , span (engineering) , heuristic , sequence (biology) , mathematical optimization , job shop scheduling , artificial intelligence , schedule , programming language , mathematics , operating system , civil engineering , biology , engineering , genetics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom