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

DOI10.1080/00207540310001595864zbMATH Open1069.90047OpenAlexW1979011355MaRDI QIDQ4655459FDOQ4655459

Authors:

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

Recommendations

• Scheduling job shops with delays
• Scheduling in flowshops to minimize total tardiness of jobs
• Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
• A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
• Approximations for the time spent in a dynamic job shop with applications to due-date assignment
• From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
• Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
• Scheduling job shop problems with sequence-dependent setup times
• Scheduling job shop problems with operators with respect to the maximum lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (6)

• Development and analysis of cost-based dispatching rules for job shop scheduling
• From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
• Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system
• Flow-shop scheduling with setup and assembly operations
• Resource constrained multi-project scheduling problem with resource transfer times
• Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling

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

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