NDLI: Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time

Content Provider	Springer Nature Link
Author	Ng, C. T. Cheng, T. C. Edwin Janiak, Adam Kovalyov, Mikhail Y.
Copyright Year	2005
Abstract	The following single machine scheduling problem is studied. A partition of a set of n jobs into g groups on the basis of group technology is given. The machine processes jobs of the same group contiguously, with a sequence independent setup time preceding the processing of each group. The setup times and the job processing times are controllable through the allocation of a continuously divisible or discrete resource to them. Each job uses the same amount of the resource. Each setup also uses the same amount of resource, which may be different from that for the jobs. Polynomial-time algorithms are constructed for variants of the problem of finding an optimal job sequence and resource values so as to minimize the total weighted job completion time, subject to given restrictions on resource consumption. The algorithms are based on a polynomial enumeration of the candidates for an optimal job sequence and solving the problem with a fixed job sequence by linear programming.
Starting Page	163
Ending Page	174
Page Count	12
File Format	PDF
ISSN	02545330
Journal	Annals of Operations Research
Volume Number	133
Issue Number	1-4
e-ISSN	15729338
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	2005-01-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	single machine scheduling group technology total weighted completion time controllable setup and processing times Theory of Computation Combinatorics Operations Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research

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

Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time

Single machine scheduling with total tardiness criterion and convex controllable processing times

A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates

GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times

A single machine scheduling problem with common due window and controllable processing times

Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem

Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times

Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time

Similar Documents

Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time

Single machine scheduling with total tardiness criterion and convex controllable processing times

A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates

GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times

A single machine scheduling problem with common due window and controllable processing times

Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem

Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times

Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time