Logo image
An exact quadratic programming approach based on convex reformulation for seru scheduling problems
Journal article   Peer reviewed

An exact quadratic programming approach based on convex reformulation for seru scheduling problems

Zhe Zhang, Xiaoling Song, Xue Gong, Yong Yin, Benjamin Lev and Xiaoyang Zhou
Naval research logistics, v 69(8), pp 1096-1107
Dec 2022

Abstract

earliness and tardiness just‐in‐time nonlinear programming non‐convex optimization production revolution
Motivated by a practical production scheduling problem at a factory, this article studies scheduling problems in seru production system (SPS). Seru is a relatively new‐type production mode originating in Japan and has brought inspiring benefits to production practice. Following the just‐in‐time philosophy of SPS, the objective of seru scheduling problem is to minimize the sum of earliness and tardiness penalties. Two common due date types of job are considered, and the seru scheduling problem is formulated as a 0–1 quadratic programming model with linear constraints that is then reformulated using convex reformulation methods to ensure convexity. Computational experiments are implemented. Experimental results indicate that the proposed exact solution method can obtain approximate optimal solutions efficiently and effectively for seru scheduling problems.

Metrics

9 Record Views
20 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#12 Responsible Consumption & Production

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
International collaboration
Web of Science research areas
Operations Research & Management Science
Logo image