Group scheduling with controllable setup and processing times: minimizing total weighted completion time

DOI10.1007/s10479-004-5030-1zbMath1119.90020OpenAlexW2012581545MaRDI QIDQ1772970

Xianqiang Yang

Publication date: 22 April 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-004-5030-1

zbMATH Keywords

single machine schedulinggroup technologytotal weighted completion timecontrollable setup and processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

A survey of scheduling with controllable processing times ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Single machine scheduling problem with controllable processing times and resource dependent release times ⋮ Single machine quadratic penalty function scheduling with deteriorating jobs and group technology ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates ⋮ Single machine group scheduling with time and position dependent processing times ⋮ Group sequencing around a common due date ⋮ Single-machine group scheduling problems with deterioration consideration ⋮ A survey of scheduling problems with setup times or costs ⋮ Single-machine scheduling with machine unavailability periods and resource dependent processing times ⋮ Bicriterion scheduling with a negotiable common due window and resource-dependent processing times ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment ⋮ Single machine scheduling problem with multiple due windows assignment in a group technology

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single machine group scheduling with resource dependent setup and processing times
• Time-optimal control in a single machine problem with resource constraints
• A bicriterion approach to time/cost trade-offs in sequencing
• Single machine scheduling problem with a common deadline and resource dependent release dates
• A polynomial algorithm for a one machine batching problem
• Single machine scheduling subject to deadlines and resource dependent processing times
• Minimizing the number of late jobs under the group technology assumption
• Single machine scheduling with discretely controllable processing times
• Single machine group scheduling with ordered criteria
• Single machine batch scheduling with deadlines and resource dependent processing times
• Scheduling with batching: A review
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Resource optimal control in some single-machine scheduling problems
• Scheduling to minimize the total compression and late costs
• Scheduling to minimize release-time resource consumption and tardiness penalties
• Single machine batch scheduling with resource dependent setup and processing times