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

DOI10.1007/s11590-022-01849-xOpenAlexW4210303430MaRDI QIDQ6063508

Rachid Benmansour, Nenad Mladenović, Mustapha Ratli, Raca Todosijević, Issam Krimi

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

single machine scheduling0-1 integer programminggeneral variable neighborhood searchearly and late workGRASP-VND

Mathematics Subject Classification ID

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

Cites Work

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

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