A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights

DOI10.1007/s13675-017-0086-2zbMath1392.90060OpenAlexW2616611648MaRDI QIDQ1742901

Hemant Salwan, Anjulika Gupta, Prabha Sharma

Publication date: 12 April 2018

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-017-0086-2

zbMATH Keywords

local searchdeteriorating jobsdominanceadjacencypermutation polyhedrarelaxed agreeable weights

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Batch scheduling of step deteriorating jobs
• Time-dependent scheduling
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• Permutation polyhedra and minimisation of the variance of completion times on a single machine
• Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Batch Scheduling of Deteriorating Products
• Dynamic priority rules for cyclic-type queues
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Adjacent Vertices on a Permutohedron
• Scheduling deteriorating jobs to minimize makespan
• Permutation Polyhedra