scientific article

zbMath1274.90140MaRDI QIDQ2861568

Adrien Bellanger, Mikhail Y. Kovalyov, Ammar Oulamara

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001654

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints

Cites Work

• Unnamed Item
• Flowshop scheduling problem with a batching machine and task compatibilities
• Scheduling hybrid flowshop with parallel batching machines and compatibilities
• Scheduling a batching machine
• On-line scheduling a batch processing system to minimize total weighted job completion time
• Minimizing mean completion time in a batch processing system
• Scheduling with batching: A review
• Minimizing total completion time on a batch processing machine with job families
• Batch processing with interval graph compatibilities between tasks
• Efficient algorithms for interval graphs and circular-arc graphs
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity

This page was built for publication: