NDLI: Multi-objective Algorithms for the Single Machine Scheduling Problem with Sequence-Dependent Family Setups

Content Provider	IEEE Xplore Digital Library
Author	Ferreira Rego, M. Freitas Souza, M.J. Arroyo, J.E.C.
Copyright Year	2012
Description	Author affiliation: DECOM, Univ. Fed. de Ouro Preto, Ouro Preto, Brazil (Ferreira Rego, M.; Freitas Souza, M.J.) \|\| DPI, Univ. Fed. de Vicosa, Vicosa, Brazil (Arroyo, J.E.C.)
Abstract	This work treats the single machine scheduling problem in which the setup time depends on the sequence and the job family. The objective is to minimize the makespan and the total weighted tardiness. In order to solve the problem, two multi-objective algorithms are analyzed: one based on Multi-objective Variable Neighborhood Search (MOVNS) and another on Pareto Iterated Local Search (PILS). Two literature algorithms based on MOVNS are adapted to solve the problem, resulting in the MOVNS Ottoni and MOVNS Arroyo variants. Also, a new perturbation procedure for the PILS is proposed, yielding the PILS1 variant. Computational experiments realized over test instances show that PILS1 is statistically better than all other algorithms in relation to the cardinality, average distance, maximum distance, difference of hypervolume and epsilon metrics.
Starting Page	142
Ending Page	151
File Size	227208
Page Count	10
File Format	PDF
ISSN	15224902
e-ISBN	9781479929382
DOI	10.1109/SCCC.2012.24
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-11-12
Publisher Place	Chile
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Measurement Job shop scheduling Multi-Objective Variable Neighborhood Search Single Machine Scheduling Pareto Iterated Local Search Search problems Mathematical model Optimization Equations Single machine scheduling Multi-Objective Optimization
Content Type	Text
Resource Type	Article

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

Multi-objective algorithms for the single machine scheduling problems with setup time dependent on the sequence and the job family

Multi-objective Variable Neighborhood Search algorithms for a just-in-time single machine scheduling problem

Hybrid variable neighborhood search for multi objective flexible job shop scheduling problem

Improvements for multi-objective flow shop scheduling by pareto iterated local search (907).

Foundations of the pareto iterated local search metaheuristic (809).

A Novel Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-shop Scheduling Problems

H.: “Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-shop Scheduling Problems (2006)

Fast iterated local search algorithm with high order neighborhood for no-wait flowshop scheduling problem

An effective discrete harmony search for solving bi-criteria FJSP

Multi-objective Algorithms for the Single Machine Scheduling Problem with Sequence-Dependent Family Setups

Similar Documents

Multi-objective algorithms for the single machine scheduling problems with setup time dependent on the sequence and the job family

Multi-objective Variable Neighborhood Search algorithms for a just-in-time single machine scheduling problem

Hybrid variable neighborhood search for multi objective flexible job shop scheduling problem

Improvements for multi-objective flow shop scheduling by pareto iterated local search (907).

Foundations of the pareto iterated local search metaheuristic (809).

A Novel Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-shop Scheduling Problems

H.: “Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-shop Scheduling Problems (2006)

Fast iterated local search algorithm with high order neighborhood for no-wait flowshop scheduling problem

An effective discrete harmony search for solving bi-criteria FJSP

Multi-objective Algorithms for the Single Machine Scheduling Problem with Sequence-Dependent Family Setups