NDLI: A CSP model for simple non-reversible and parallel repair plans

Content Provider	Springer Nature Link
Author	Del Valle, Carmelo Márquez, Antonio Barba, Irene
Copyright Year	2008
Abstract	This work presents a constraint satisfaction problem (CSP) model for the planning and scheduling of disassembly and assembly tasks when repairing or substituting faulty parts. The problem involves not only the ordering of assembly and disassembly tasks, but also the selection of them from a set of alternatives. The goal of the plan is the minimization of the total repairing time, and the model considers, apart from the durations and resources used for the assembly and disassembly tasks, the necessary delays due to the change of configuration in the machines, and to the transportation of intermediate subassemblies between different machines. The problem considers that sub-assemblies that do not contain the faulty part are nor further disassembled, but allows non-reversible and parallel repair plans. The set of all feasible repair plans are represented by an extended And/Or graph. This extended representation embodies all of the constraints of the problem, such as temporal and resource constraints and those related to the selection of tasks for obtaining a correct plan.
Starting Page	165
Ending Page	174
Page Count	10
File Format	PDF
ISSN	09565515
Journal	Journal of Intelligent Manufacturing
Volume Number	21
Issue Number	1
e-ISSN	15728145
Language	English
Publisher	Springer US
Publisher Date	2008-11-14
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Planning Scheduling Constraints Assembly Disassembly Repair Manufacturing, Machines, Tools Production/Logistics Control , Robotics, Mechatronics
Content Type	Text
Resource Type	Article
Subject	Industrial and Manufacturing Engineering Artificial Intelligence 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

Constraint satisfaction techniques in planning and scheduling

Introduction to planning, scheduling and constraint satisfaction

Planning and scheduling teams of skilled workers

Makespan minimization for scheduling unrelated parallel machines with setup times

A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines

A GRASP approach for makespan minimization on parallel batch processing machines

A grammatical optimization approach for integrated process planning and scheduling

Differential evolution variants to schedule flexible assembly lines

Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines

A CSP model for simple non-reversible and parallel repair plans

Similar Documents

Constraint satisfaction techniques in planning and scheduling

Introduction to planning, scheduling and constraint satisfaction

Planning and scheduling teams of skilled workers

Makespan minimization for scheduling unrelated parallel machines with setup times

A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines

A GRASP approach for makespan minimization on parallel batch processing machines

A grammatical optimization approach for integrated process planning and scheduling

Differential evolution variants to schedule flexible assembly lines

Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines

A CSP model for simple non-reversible and parallel repair plans