Just-in-time job-shop scheduling (JIT-JSS) is a variant of the job-shop scheduling problem,
in which each operation has a distinct due-date and any deviation of the operation …

In the just-in-time job-shop scheduling (JIT–JSS) problem every operation has a distinct due-
date, and earliness and tardiness penalties. Any deviation from the due-date incurs …

This study addresses an unrelated parallel machine scheduling problem with family setups
and soft time windows, which includes considerations for machine eligibility. The objective is …

This paper proposes exact algorithms to generate optimal timing schedules for a given
sequence of operations in job shops to minimize the total weighted earliness and tardiness …

针对作业车间准时制生产调度这类典型的非正规性能指标调度问题, 采用禁忌搜索和数学规划的
混合策略进行求解, 即在每一迭代搜索过程中, 首先由禁忌搜索得到各机器上的工序加工序列 …

Abstract The Traveling Thief Problem (TTP) is a multi-component combinatorial optimization
problem that combines two well-known problems in the literature: the Traveling Salesman …

This paper studies a just-in-time job-shop scheduling problem (JITJSSP) in which each
operation has an earliness cost or a tardiness cost if it is completed before or after its due …

This paper focuses on the optimization of job-shop scheduling in industrial production
systems in the just-in-time configuration. The scheduling function plays a crucial role in …

The classical machine (ie single and parallel machine) and shop scheduling (ie fow-shop,
job-shop and open-shop) problems are concerned with performing a set of independent …

The development of heuristics techniques has emerged over the years to address complex
decision-making process in the various fields of social sciences. With many advantages of …