Optimal due date assignment without restriction and convex resource allocation in group technology scheduling

DOI10.1007/978-3-030-92681-6_36OpenAlexW4205309120MaRDI QIDQ2150570

Yanyan Li

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_36

zbMATH Keywords

single machine schedulinggroup technologydue date assignmentconvex resource allocation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

On optimal due date assignment without restriction and resource allocation in group technology scheduling

Cites Work

• Optimal restricted due date assignment in scheduling
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• Single-machine group scheduling with processing times dependent on position, starting time and allotted resource
• Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production
• Single machine scheduling problem with multiple due windows assignment in a group technology
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems

This page was built for publication: Optimal due date assignment without restriction and convex resource allocation in group technology scheduling