Cite this DOI
10.46243/jst.2020.v5.i5.pp154-161 · Computational Experiments on Workflow Balancing of Parallel Machine Scheduling with Precedence Constraints and Sequence Independent Setup Time
APA (7th edition)
Longman Publishers (2020). Computational Experiments on Workflow Balancing of Parallel Machine Scheduling with Precedence Constraints and Sequence Independent Setup Time. *Journal of Science & Technology*, 154–161. https://doi.org/10.46243/jst.2020.v5.i5.pp154-161
⬇ text Italics are shown as *asterisks* in plain text — the journal or book title and the volume.
BibTeX
@article{anon2020computational,
title = {{Computational Experiments on Workflow Balancing of Parallel Machine Scheduling with Precedence Constraints and Sequence Independent Setup Time}},
journal = {Journal of Science \& Technology},
year = {2020},
month = {oct},
number = {Volume 5},
pages = {154--161},
publisher = {Longman Publishers},
issn = {2456-5660},
doi = {10.46243/jst.2020.v5.i5.pp154-161},
url = {https://doi.org/10.46243/jst.2020.v5.i5.pp154-161},
language = {en},
abstract = {The workflow balancing of parallel machines scheduling (PMS) with precedence constraints and sequence independent setup time is considered for study. The setup time consideration produces alternate schedule along with lesser relative percentage of imbalance (RPI) value for PMS problem is demonstrated with an example. The lesser RPI indicates better workflow balancing among machines. The computational experiments are conducted on large instances of randomly generated PMS problems with precedent constraints and setup time. The various combinations of heuristics are used to solve the problems. The results show that genetic algorithm (GA) performs well against the other heuristics with lesser RPI values}
}RIS (EndNote, Zotero, Mendeley)
TY - JOUR TI - Computational Experiments on Workflow Balancing of Parallel Machine Scheduling with Precedence Constraints and Sequence Independent Setup Time JO - Journal of Science & Technology PY - 2020 DA - 2020/10/12/ IS - Volume 5 SP - 154 EP - 161 PB - Longman Publishers SN - 2456-5660 LA - en AB - The workflow balancing of parallel machines scheduling (PMS) with precedence constraints and sequence independent setup time is considered for study. The setup time consideration produces alternate schedule along with lesser relative percentage of imbalance (RPI) value for PMS problem is demonstrated with an example. The lesser RPI indicates better workflow balancing among machines. The computational experiments are conducted on large instances of randomly generated PMS problems with precedent constraints and setup time. The various combinations of heuristics are used to solve the problems. The results show that genetic algorithm (GA) performs well against the other heuristics with lesser RPI values DO - 10.46243/jst.2020.v5.i5.pp154-161 UR - https://doi.org/10.46243/jst.2020.v5.i5.pp154-161 ER -
CSL-JSON
{
"type": "article-journal",
"id": "10.46243/jst.2020.v5.i5.pp154-161",
"DOI": "10.46243/jst.2020.v5.i5.pp154-161",
"URL": "https://doi.org/10.46243/jst.2020.v5.i5.pp154-161",
"title": "Computational Experiments on Workflow Balancing of Parallel Machine Scheduling with Precedence Constraints and Sequence Independent Setup Time",
"source": "Smart Scholars DOI Registry",
"container-title": "Journal of Science & Technology",
"issued": {
"date-parts": [
[
2020,
10,
12
]
]
},
"issue": "Volume 5",
"page": "154-161",
"publisher": "Longman Publishers",
"language": "en",
"abstract": "The workflow balancing of parallel machines scheduling (PMS) with precedence constraints and sequence independent setup time is considered for study. The setup time consideration produces alternate schedule along with lesser relative percentage of imbalance (RPI) value for PMS problem is demonstrated with an example. The lesser RPI indicates better workflow balancing among machines. The computational experiments are conducted on large instances of randomly generated PMS problems with precedent constraints and setup time. The various combinations of heuristics are used to solve the problems. The results show that genetic algorithm (GA) performs well against the other heuristics with lesser RPI values",
"ISSN": "2456-5660"
} ⬇ .json What citeproc and reference managers read; the DOI system hands it out for Accept: application/vnd.citationstyles.csl+json, and so does this registry's resolver.
From the record as registered (version 2) — the record and its history. Programs: https://registry.smartscholars.in/api.php?action=cite&doi=10.46243%2Fjst.2020.v5.i5.pp154-161 gives all four in one JSON answer.
