Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
Summary: Because the alternative process plans have significant contributions to the production efficiency of a manufacturing system, researchers have studied the integration of manufacturing functions, which can be divided into two groups, namely, integrated process planning and scheduling (IPPS) and scheduling with due date assignment (SWDDA). Although IPPS and SWDDA are well-known and solved problems in the literature, there are limited works on integration of process planning, scheduling, and due date assignment (IPPSDDA). In this study, due date assignment function was added to IPPS in a dynamic manufacturing environment. And the studied problem was introduced as dynamic integrated process planning, scheduling, and due date assignment (DIPPSDDA). The objective function of DIPPSDDA is to minimize earliness and tardiness (E/T) and determine due dates for each job. Furthermore, four different pure metaheuristic algorithms which are genetic algorithm (GA), tabu algorithm (TA), simulated annealing (SA), and their hybrid (combination) algorithms GA/SA and GA/TA have been developed to facilitate and optimize DIPPSDDA on the 8 different sized shop floors. The performance comparisons of the algorithms for each shop floor have been given to show the efficiency and effectiveness of the algorithms used. In conclusion, computational results show that the proposed combination algorithms are competitive, give better results than pure metaheuristics, and can effectively generate good solutions for DIPPSDDA problems.
- Solving integrated process planning and scheduling problem with constructive meta-heuristics
- An object-coding genetic algorithm for integrated process planning and scheduling
- An integrated approach based on fuzzy inference system for scheduling and process planning through multiple objectives
- Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling
- Integration of process planning and scheduling for distributed flexible job shops
- A common due-data assignment problem on parallel identical machines
- A differential evolution approach for the common due date early/tardy job scheduling problem
- A due date assignment algorithm for multiproduct manufacturing facilities
- A dynamic programming method for single machine scheduling
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- A hybrid method for the planning and scheduling
- A note on a due-date assignment on a two-machine flow-shop
- A survey of the state-of-the-art of common due date assignment and scheduling research
- An agent-based negotiation approach to integrate process planning and scheduling
- An alternative proof of optimality for the common due-date assignment problem
- An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines
- Batch scheduling and common due date assignment problem: An NP-hard case
- Common due date assignment and scheduling with ready times
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Due dates assignment and JIT scheduling with equal-size jobs
- Dynamic job shop scheduling using variable neighbourhood search
- Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- Integrated process planning and scheduling/rescheduling—an agent-based approach
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
- Integration of process planning and scheduling by exploring the flexibility of process planning
- Job sequencing and due date assignment in a single machine shop with uncertain processing times
- Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Minmax scheduling problems with common due-date and completion time penalty
- Optimal due-date determination and sequencing with random processing times
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach
- Optimization by simulated annealing
- Scheduling about a common due date with earliness and tardiness penalties
- Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
- Scheduling under a common due-date on parallel unrelated machines
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Scheduling. Theory, algorithms, and systems
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine scheduling and due date assignment with positionally dependent processing times
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- Single machine scheduling with assignable due dates
- Single machine scheduling with common due data assignment in a group technology environment
- Single machine scheduling with common due date and controllable processing times
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Survey of scheduling research involving due date determination decisions
- The Single Machine Early/Tardy Problem
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises
- Variable parameters lengths genetic algorithm for minimizing earliness-tardiness penalties of single machine scheduling with a common due date
This page was built for publication: Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298093)
