Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries

DOI10.1016/j.tcs.2014.12.021zbMath1306.90055OpenAlexW2004522411MaRDI QIDQ2514125

Chung-Lun Li

Publication date: 30 January 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.021

zbMATH Keywords

computational complexityschedulingdue windowbatch delivery

Mathematics Subject Classification ID

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

Related Items (1)

A knowledge-based approach for multi-factory production systems

Cites Work

• Unnamed Item
• Unnamed Item
• Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning
• Due-window assignment problems with unit-time jobs
• Scheduling a maintenance activity and due-window assignment on a single machine
• A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
• Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
• Single-machine common due window assignment and scheduling to minimize the total cost
• Due-window assignment with identical jobs on parallel uniform machines
• Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
• Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
• Scheduling problems with a common due window assignment: A survey
• COMMON DUE-WINDOW ASSIGNMENT AND SCHEDULING OF JOB-DEPENDENT DETERIORATING JOBS AND MULTIPLE DETERIORATING MAINTENANCE ACTIVITIES

This page was built for publication: Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries