Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery

DOI10.1007/978-3-030-57602-8_47MaRDI QIDQ2039713zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 5 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-57602-8_47

zbMATH Keywords

approximation algorithmparallel-batchproduction and deliveryunavailability constraint

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
• Machine scheduling with an availability constraint and job delivery coordination
• Two parallel machines scheduling with one availability constraint and jobs with delivery times
• Single batch machine scheduling with deliveries
• Unbounded parallel-batch scheduling with family jobs and delivery coordination

Cites work

• Improved algorithms for two single machine scheduling problems
• Improved bounds for batch scheduling with nonidentical job sizes
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Integrated scheduling of production and distribution for manufacturers with parallel batching facilities
• Integrated Scheduling of Production and Distribution Operations
• Machine scheduling with an availability constraint
• Machine scheduling with an availability constraint and job delivery coordination
• Machine scheduling with job delivery coordination
• Machine scheduling with transportation considerations
• On the machine scheduling problem with job delivery coordination
• Supply Chain Scheduling: Batching and Delivery
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Unbounded parallel batch scheduling with job delivery to minimize makespan
• Unbounded parallel-batch scheduling with family jobs and delivery coordination

Cited in

(11)

• Unbounded parallel-batch scheduling with family jobs and delivery coordination
• Modeling and solving the waste valorization production and distribution scheduling problem
• Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance
• Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
• Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
• Two parallel machines scheduling with one availability constraint and jobs with delivery times
• Machine scheduling with an availability constraint and job delivery coordination
• Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
• Online scheduling on a parallel-batch machine with pulse interruptions
• Optimal algorithms for online batch scheduling with all possible equal-processing times under periodic pulse interruptions
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval

This page was built for publication: Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery

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