A Solution for the Scheduling Problem in a Multi-Plant and Multi-Product Environment

1
Nahid Newaj
Nahid Newaj
1 Rajshahi University of Engineering & Technology

Send Message

To: Author

GJRE Volume 14 Issue G1

Article Fingerprint

ReserarchID

36C6M

A Solution for the Scheduling Problem in a Multi-Plant and Multi-Product Environment Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Scheduling is an important tool for manufacturing and engineering, where it can have a major impact on the productivity of a process. In this paper, we use flow shop scheduling in KCCL (Kohinoor Chemical Company Limited) & find out the optimum policy in scheduling operating several machines to produce soap & to reduce idle time of machines. Considering different type of machine that also absorbs different production time. The industry tries to identify their idle time & best presidential relationship between the machines. We use Johnson’s scheduling algorithm & a numerical output is achieved.

6 Cites in Articles

References

  1. (2010). Front Matter.
  2. T Cheng,C Sin (1990). A state-of-the-art review of parallel-machine scheduling research.
  3. M I Dessouky,B J Lageweg,J Lenstra,S Van De Velde (1990). Scheduling identical jobs on uniform parallel Machines.
  4. M Carey,D Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness.
  5. E Lawler,J Lenstra,A Rinnooy Kan (1982). Recent developments in deterministic sequencing and scheduling.
  6. Graham Mcmahon,Michael Florian (1975). On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Nahid Newaj. 2014. \u201cA Solution for the Scheduling Problem in a Multi-Plant and Multi-Product Environment\u201d. Global Journal of Research in Engineering - G: Industrial Engineering GJRE-G Volume 14 (GJRE Volume 14 Issue G1): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjre

Print ISSN 0975-5861

e-ISSN 2249-4596

Classification
Not Found
Version of record

v1.2

Issue date

March 27, 2014

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 4817
Total Downloads: 2373
2026 Trends
Research Identity (RIN)
Related Research

Published Article

Scheduling is an important tool for manufacturing and engineering, where it can have a major impact on the productivity of a process. In this paper, we use flow shop scheduling in KCCL (Kohinoor Chemical Company Limited) & find out the optimum policy in scheduling operating several machines to produce soap & to reduce idle time of machines. Considering different type of machine that also absorbs different production time. The industry tries to identify their idle time & best presidential relationship between the machines. We use Johnson’s scheduling algorithm & a numerical output is achieved.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

A Solution for the Scheduling Problem in a Multi-Plant and Multi-Product Environment

Nahid Newaj
Nahid Newaj Rajshahi University of Engineering & Technology

Research Journals