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

DOI10.1007/S13675-017-0086-2MaRDI QIDQ1742901zbMATH OpenOpenAlexFDO

Authors Anjulika Gupta, Prabha Sharma, Hemant Salwan

Publication date 12 April 2018

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

adjacencydeteriorating jobsdominancelocal searchpermutation polyhedrarelaxed agreeable weights

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling deteriorating jobs to minimize makespan
• Considerations of single-machine scheduling with deteriorating jobs
• On a scheduling problem of time deteriorating jobs
• Scheduling with step-deteriorating jobs to minimize the makespan
• Partial dominated schedules and minimizing the total completion time of deteriorating jobs

Cites work

• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• Adjacent Vertices on a Permutohedron
• Batch scheduling of deteriorating products
• Batch scheduling of step deteriorating jobs
• Dynamic priority rules for cyclic-type queues
• scientific article; zbMATH DE number 3521521 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• 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
• Permutation Polyhedra
• Permutation polyhedra and minimisation of the variance of completion times on a single machine
• Scheduling deteriorating jobs to minimize makespan
• Time-dependent scheduling
• V-Shaped Policies for Scheduling Deteriorating Jobs

Cited in

(1)

• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan

This page was built for publication: A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742901)