Optimal due date assignment and resource allocation in a group technology scheduling environment

DOI10.1016/J.COR.2010.03.012MaRDI QIDQ991385zbMATH OpenOpenAlexFDO

Authors Dvir Shabtay, Yisrael Itskovich, Liron Yedidsion, Daniel Oron

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

zbMATH Keywords

resource allocationsingle-machine schedulingearliness-tardinessgroup technologyfamily due date assignment method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On optimal due date assignment without restriction and resource allocation in group technology scheduling
• Single machine scheduling with common due data assignment in a group technology environment
• Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
• Group sequencing around a common due date
• Group scheduling on a single machine with due date assignment and learning effects

Cites work

• scientific article; zbMATH DE number 4035555 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3014822 (Why is no real title available?)
• scientific article; zbMATH DE number 1859296 (Why is no real title available?)
• A common due-data assignment problem on parallel identical machines
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• A note on a due-date assignment on a two-machine flow-shop
• A survey of results for sequencing problems with controllable processing times
• A survey of scheduling with controllable processing times
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Batch scheduling and common due-date assignment on a single machine
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Group scheduling with controllable setup and processing times: minimizing total weighted completion time
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing completion time variance with compressible processing times
• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Scheduling Multiple Variable-Speed Machines
• Scheduling with controllable release dates and processing times: total completion time minimization
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• Single machine batch scheduling to minimize total completion time and resource consumption costs
• Single machine group scheduling with resource dependent setup and processing times
• Single machine scheduling subject to deadlines and resource dependent processing times
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• Single machine scheduling with controllable release and processing parameters
• Single-machine sequencing with controllable processing times
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• Two parallel machine sequencing problems involving controllable job processing times

Cited in

(17)

• Two-stage medical supply chain scheduling with an assignable common due window and shelf life
• Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
• Order acceptance and due-date quotation in low machine rates
• Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times
• Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
• Group Scheduling with Two Competing Agents on a Single Machine
• Optimal due date assignment without restriction and convex resource allocation in group technology scheduling
• Single machine scheduling problem with multiple due windows assignment in a group technology
• Batch scheduling of identical jobs with controllable processing times
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
• On optimal due date assignment without restriction and resource allocation in group technology scheduling
• Group sequencing around a common due date
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
• A single machine group scheduling problem with due date assignment and position-dependent costs
• Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains

This page was built for publication: Optimal due date assignment and resource allocation in a group technology scheduling environment

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