Clarifying cutting and sewing processes with due windows using an effective ant colony optimization

DOI10.1155/2013/182598zbMATH Open1296.90145OpenAlexW2021686960WikidataQ59023386 ScholiaQ59023386MaRDI QIDQ460244FDOQ460244

Rong-Hwa Huang, Shun-Chi Yu

Publication date: 13 October 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/182598

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• Vehicle routing problem for fashion supply chains with cross-docking
• A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem
• Two-machine flowshop scheduling with flexible operations and controllable processing times
• A heuristic method for two-stage hybrid flow shop with dedicated machines
• Evaluation of mathematical models for flexible job-shop scheduling problems
• Parallel machine scheduling with common due windows
• Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
• Optimal Scheduling of a Single-Supplier Single-Manufacturer Supply Chain With Common due Windows

Cited In (2)

• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
• Improving the performance of modular production in the apparel assembly: a mathematical programming approach

This page was built for publication: Clarifying cutting and sewing processes with due windows using an effective ant colony optimization

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