Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs
- Author
- MADHUSHINI, N1 ; RAJENDRAN, C1 ; DEEPA, Y1
[1] Indian Institute of Technology Madras, Chennai, India - Source
The Journal of the Operational Research Society. = OR. 2009, Vol 60, Num 7, pp 991-1004, 14 p ; ref : 3/4 p
- CODEN
- JORSDZ
- ISSN
- 0160-5682
- Scientific domain
- Control theory, operational research
- Publisher
- Palgrave Macmillan, Basingstoke
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Author keyword
- assignment problem branch-and-bound algorithms flowshop scheduling weighted earliness weighted flowtime weighted tardiness
- Keyword (fr)
- Arbre graphe Atelier monogamme Borne inférieure Date échéance Méthode séparation et évaluation Ordonnancement Permutation Problème affectation Précocité Retard Résolution problème
- Keyword (en)
- Tree(graph) Flow shop Lower bound Due date Branch and bound method Scheduling Permutation Assignment problem Earliness Delay Problem solving
- Keyword (es)
- Arbol grafo Flow shop Cota inferior Fecha vencimiento Método branch and bound Reglamento Permutación Problema asignación Precocidad Retraso Resolución problema
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A12 Scheduling, sequencing
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 21543291
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1057/palgrave.jors.2602642 
https://dx.doi.org/10.1057/palgrave.jors.2602642
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602642\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:258:\"Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime\/sum of weighted tardiness\/sum of weighted flowtime and weighted tardiness\/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs\";s:9:\"\u0000*\u0000jtitle\";s:47:\"The Journal of the Operational Research Society\";s:9:\"\u0000*\u0000stitle\";s:17:\"J. Oper. Res. Soc\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"60\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:3:\"991\";s:8:\"\u0000*\u0000epage\";s:4:\"1004\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0160-5682\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"MADHUSHINI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"N\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:12:\"RAJENDRAN, C\";i:1;s:8:\"DEEPA, Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JORSDZ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:258:\"Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime\/sum of weighted tardiness\/sum of weighted flowtime and weighted tardiness\/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs\";s:8:\"\u0000*\u0000place\";s:11:\"Basingstoke\";s:6:\"\u0000*\u0000pub\";s:18:\"Palgrave Macmillan\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602642\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:258:\"Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime\/sum of weighted tardiness\/sum of weighted flowtime and weighted tardiness\/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs\";s:9:\"\u0000*\u0000jtitle\";s:47:\"The Journal of the Operational Research Society\";s:9:\"\u0000*\u0000stitle\";s:17:\"J. Oper. Res. Soc\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"60\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:3:\"991\";s:8:\"\u0000*\u0000epage\";s:4:\"1004\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0160-5682\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"MADHUSHINI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"N\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:12:\"RAJENDRAN, C\";i:1;s:8:\"DEEPA, Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JORSDZ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:258:\"Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime\/sum of weighted tardiness\/sum of weighted flowtime and weighted tardiness\/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs\";s:8:\"\u0000*\u0000place\";s:11:\"Basingstoke\";s:6:\"\u0000*\u0000pub\";s:18:\"Palgrave Macmillan\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602642\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602642\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:258:\"Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime\/sum of weighted tardiness\/sum of weighted flowtime and weighted tardiness\/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs\";s:9:\"\u0000*\u0000jtitle\";s:47:\"The Journal of the Operational Research Society\";s:9:\"\u0000*\u0000stitle\";s:17:\"J. Oper. Res. Soc\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"60\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:3:\"991\";s:8:\"\u0000*\u0000epage\";s:4:\"1004\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0160-5682\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"MADHUSHINI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"N\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:12:\"RAJENDRAN, C\";i:1;s:8:\"DEEPA, Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JORSDZ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:258:\"Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime\/sum of weighted tardiness\/sum of weighted flowtime and weighted tardiness\/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs\";s:8:\"\u0000*\u0000place\";s:11:\"Basingstoke\";s:6:\"\u0000*\u0000pub\";s:18:\"Palgrave Macmillan\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602642\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:258:\"Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime\/sum of weighted tardiness\/sum of weighted flowtime and weighted tardiness\/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs\";s:9:\"\u0000*\u0000jtitle\";s:47:\"The Journal of the Operational Research Society\";s:9:\"\u0000*\u0000stitle\";s:17:\"J. Oper. Res. Soc\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"60\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:3:\"991\";s:8:\"\u0000*\u0000epage\";s:4:\"1004\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0160-5682\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"MADHUSHINI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"N\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:12:\"RAJENDRAN, C\";i:1;s:8:\"DEEPA, Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JORSDZ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:258:\"Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime\/sum of weighted tardiness\/sum of weighted flowtime and weighted tardiness\/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs\";s:8:\"\u0000*\u0000place\";s:11:\"Basingstoke\";s:6:\"\u0000*\u0000pub\";s:18:\"Palgrave Macmillan\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1057\/palgrave.jors.2602642\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:258:\"Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime\/sum of weighted tardiness\/sum of weighted flowtime and weighted tardiness\/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs\";s:9:\"\u0000*\u0000jtitle\";s:47:\"The Journal of the Operational Research Society\";s:9:\"\u0000*\u0000stitle\";s:17:\"J. Oper. Res. Soc\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"60\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:3:\"991\";s:8:\"\u0000*\u0000epage\";s:4:\"1004\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0160-5682\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"MADHUSHINI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"N\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:12:\"RAJENDRAN, C\";i:1;s:8:\"DEEPA, Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JORSDZ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:258:\"Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime\/sum of weighted tardiness\/sum of weighted flowtime and weighted tardiness\/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs\";s:8:\"\u0000*\u0000place\";s:11:\"Basingstoke\";s:6:\"\u0000*\u0000pub\";s:18:\"Palgrave Macmillan\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
