Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
DOI10.1155/2019/1572614zbMATH Open1435.90065OpenAlexW2947620043WikidataQ125371181 ScholiaQ125371181MaRDI QIDQ2298093FDOQ2298093
Caner Erden, H. Demir, Abdullah Hulusi Kökçam
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/1572614
Recommendations
- 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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization by Simulated Annealing
- Title not available (Why is that?)
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Integration of process planning and scheduling by exploring the flexibility of process planning
- Integrated process planning and scheduling/rescheduling—an agent-based approach
- An agent-based negotiation approach to integrate process planning and scheduling
- A hybrid method for the planning and scheduling
- Survey of scheduling research involving due date determination decisions
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling
- A dynamic programming method for single machine scheduling
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Sequencing with Earliness and Tardiness Penalties: A Review
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
- Single machine scheduling with assignable due dates
- Common due date assignment and scheduling with ready times
- Single machine scheduling with common due date and controllable processing times
- An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines
- The Single Machine Early/Tardy Problem
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
- Due dates assignment and JIT scheduling with equal-size jobs
- A note on a due-date assignment on a two-machine flow-shop
- A differential evolution approach for the common due date early/tardy job scheduling problem
- Scheduling under a common due-date on parallel unrelated machines
- Optimal due-date determination and sequencing with random processing times
- Dynamic job shop scheduling using variable neighbourhood search
- Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises
- Single machine scheduling and due date assignment with positionally dependent processing times
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Single machine scheduling with common due data assignment in a group technology environment
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- A common due-data assignment problem on parallel identical machines
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
- Scheduling about a common due date with earliness and tardiness penalties
- Minmax scheduling problems with common due-date and completion time penalty
- Variable parameters lengths genetic algorithm for minimizing earliness-tardiness penalties of single machine scheduling with a common due date
- An alternative proof of optimality for the common due-date assignment problem
- Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
- A due date assignment algorithm for multiproduct manufacturing facilities
- Scheduling
- Batch scheduling and common due date assignment problem: An NP-hard case
- Job sequencing and due date assignment in a single machine shop with uncertain processing times
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
Uses Software
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)