Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs

DOI10.1080/00207540310001595864zbMath1069.90047OpenAlexW1979011355MaRDI QIDQ4655459

No author found.

Publication date: 11 March 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540310001595864

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling ⋮ Flow-shop scheduling with setup and assembly operations ⋮ Resource Constrained Multi-Project Scheduling Problem with Resource Transfer Times ⋮ Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of priority rule-based scheduling
• Due date assignment procedures with dynamically updated coefficients for multilevel assembly job shops
• Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures
• Improving job shop performance by coordinating dispatching rules
• A comparison of job shop dispatching rules using a total cost criterion
• New dispatching rules for shop scheduling: A step forward
• Dispatching rules for scheduling in assembly jobshops - Part 1
• Dispatching rules for scheduling in assembly jobshops - Part 2
• Sequencing CONWIP flow-shops: Analysis and heuristics
• A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
• Review of sequencing research

This page was built for publication: Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs