NDLI: Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models

Content Provider	Springer Nature Link
Author	Hu, Po Chieng
Copyright Year	2004
Abstract	The worker assignment scheduling problem consists of two basic questions of job scheduling and worker assignment. In this study, only the performance measure of total flow time is investigated in the model of identical parallel-machine with nonpreemptive jobs. Because the worker assignment scheduling problem in this specific model can be shown as NP-complete, heuristics have been developed for minimizing the total flow time. This selected worker assignment scheduling problem is solved in two stages of job scheduling and worker assignment. The shortest processing time for Ai part (SPT-A) heuristic is used for the stage of job scheduling. For the stage of worker assignment, the largest marginal contribution (LMC) procedure is used to minimize the total flow time. Two 100 I/P/n/m/W problems were simulated; results obtained by the heuristics are either optimal or near optimal. In conclusion, the heuristics developed have shown very impressive results quite efficiently.
Starting Page	1046
Ending Page	1052
Page Count	7
File Format	PDF
ISSN	02683768
Journal	The International Journal of Advanced Manufacturing Technology
Volume Number	25
Issue Number	9-10
e-ISSN	14333015
Language	English
Publisher	Springer-Verlag
Publisher Date	2004-04-07
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	LMC procedure NP-complete SPT-A heuristic Tardiness Worker assignment scheduling problem Computer-Aided Engineering (CAD, CAE) and Design Mechanical Engineering Industrial and Production Engineering Production/Logistics
Content Type	Text
Resource Type	Article
Subject	Industrial and Manufacturing Engineering Control and Systems Engineering Mechanical Engineering Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel-machine models

Further study of minimizing total flowtime for the worker assignment scheduling problem in the identical parallel-machine models

Minimising total tardiness for the worker assignment scheduling problem in identical parallel-machine models

Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms

Minimizing flow time for the worker assignment problem in identical parallel machine models using GA

A tardiness-concerned constructive method for the identical parallel machine scheduling

Parallel machine scheduling with earliness-tardiness penalties and space limits

Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization

Simple heuristic to minimize total tardiness in a single machine scheduling problem

Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models

Similar Documents

Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel-machine models

Further study of minimizing total flowtime for the worker assignment scheduling problem in the identical parallel-machine models

Minimising total tardiness for the worker assignment scheduling problem in identical parallel-machine models

Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms

Minimizing flow time for the worker assignment problem in identical parallel machine models using GA

A tardiness-concerned constructive method for the identical parallel machine scheduling

Parallel machine scheduling with earliness-tardiness penalties and space limits

Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization

Simple heuristic to minimize total tardiness in a single machine scheduling problem

Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models