Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon
From MaRDI portal
Publication:879577
DOI10.1016/j.amc.2006.05.188zbMath1149.90059OpenAlexW2031676209MaRDI QIDQ879577
A. Mohamadinia, Mehdi Iranpoor, Seyyed Mohammad Taghi Fatemi Ghomi
Publication date: 14 May 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.188
Cites Work
- Earliness--tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming
- Minimizing the average deviation of job completion times about a common due date
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
This page was built for publication: Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon
