A no-delay single machine scheduling problem to minimize total weighted early and late work

DOI10.1007/S11590-022-01849-XMaRDI QIDQ6063508zbMATH OpenOpenAlexFDO

Authors Issam Krimi, R. Ben-Mansour, Raca Todosijević, Nenad Mladenović, Mustapha Ratli

Publication date 7 November 2023

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-022-01849-x

zbMATH Keywords

0-1 integer programmingearly and late workgeneral variable neighborhood searchGRASP-VNDsingle machine scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single-machine scheduling with deadlines to minimize the total weighted late work
• Single machine scheduling problem with minimize total weighted early work
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Single Machine Scheduling to Minimize Total Weighted Late Work
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• A single machine scheduling problem to minimize total early work
• Single machine scheduling to minimize total weighted tardiness

Cites work

• A new adaptive multi-start technique for combinatorial global optimizations
• A single machine scheduling problem to minimize total early work
• Approximation algorithms for scheduling a single machine to minimize total late work
• Minimizing total late work on a single machine with generalized due-dates
• Mirror scheduling problems with early work and late work criteria
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Open shop scheduling problems with late work criteria.
• Optimization by GRASP. Greedy randomized adaptive search procedures
• Semi-online scheduling on two identical machines with a common due date to maximize total early work
• Single Machine Scheduling to Minimize Total Late Work
• Single Machine Scheduling to Minimize Total Weighted Late Work
• Single-machine scheduling with multi-agents to minimize total weighted late work
• Two-machine flow-shop scheduling to minimize total late work: revisited
• Variable neighborhood search: basics and variants

Cited in

(1)

• Self-adaptive general variable neighborhood search algorithm for parallel machine scheduling with unrelated servers

This page was built for publication: A no-delay single machine scheduling problem to minimize total weighted early and late work

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