Optimal due date assignment and resource allocation in a group technology scheduling environment
From MaRDI portal
Publication:991385
DOI10.1016/J.COR.2010.03.012zbMath1231.90214OpenAlexW2063886660MaRDI QIDQ991385
Yisrael Itskovich, Daniel Oron, Dvir Shabtay, Liron Yedidsion
Publication date: 7 September 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.03.012
single-machine schedulingearliness-tardinessresource allocationgroup technologyfamily due date assignment method
Related Items (15)
Order acceptance and due-date quotation in low machine rates ⋮ Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates ⋮ Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times ⋮ Optimal due date assignment without restriction and convex resource allocation in group technology scheduling ⋮ Batch scheduling of identical jobs with controllable processing times ⋮ Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine ⋮ On optimal due date assignment without restriction and resource allocation in group technology scheduling ⋮ Two-stage medical supply chain scheduling with an assignable common due window and shelf life ⋮ Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time ⋮ Group Scheduling with Two Competing Agents on a Single Machine ⋮ Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling ⋮ Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity ⋮ SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT ⋮ Single machine scheduling problem with multiple due windows assignment in a group technology ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single machine group scheduling with resource dependent setup and processing times
- Single machine batch scheduling to minimize total completion time and resource consumption costs
- A survey of results for sequencing problems with controllable processing times
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Single-machine sequencing with controllable processing times
- Single machine scheduling subject to deadlines and resource dependent processing times
- Two parallel machine sequencing problems involving controllable job processing times
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A note on a due-date assignment on a two-machine flow-shop
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Minimizing completion time variance with compressible processing times
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Minimizing the total weighted flow time in a single machine with controllable processing times
- A survey of scheduling with controllable processing times
- Scheduling with controllable release dates and processing times: total completion time minimization
- Single machine scheduling with controllable release and processing parameters
- Batch scheduling and common due-date assignment on a single machine
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Multiple Variable-Speed Machines
- Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
- A common due-data assignment problem on parallel identical machines
This page was built for publication: Optimal due date assignment and resource allocation in a group technology scheduling environment